/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:36:13,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:36:13,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:36:13,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:36:13,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:36:13,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:36:13,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:36:13,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:36:13,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:36:13,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:36:13,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:36:13,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:36:13,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:36:13,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:36:13,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:36:13,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:36:13,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:36:13,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:36:13,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:36:13,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:36:13,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:36:13,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:36:13,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:36:13,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:36:13,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:36:13,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:36:13,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:36:13,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:36:13,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:36:13,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:36:13,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:36:13,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:36:13,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:36:13,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:36:13,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:36:13,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:36:13,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:36:13,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:36:13,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:36:13,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:36:13,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:36:13,508 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:36:13,535 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:36:13,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:36:13,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:36:13,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:36:13,537 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:36:13,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:36:13,537 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:36:13,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:36:13,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:36:13,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:36:13,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:36:13,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:36:13,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:36:13,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:36:13,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:36:13,539 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:36:13,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:36:13,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:36:13,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:36:13,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:36:13,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:36:13,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:36:13,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:36:13,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:36:13,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:36:13,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:36:13,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:36:13,544 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:36:13,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:36:13,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:36:13,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:36:13,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:36:13,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:36:13,829 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:36:13,829 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:36:13,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2019-12-27 07:36:13,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86eb3b810/8397bfeb776d4278a6c40f2eeb523bfa/FLAG9dd0996e9 [2019-12-27 07:36:14,525 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:36:14,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2019-12-27 07:36:14,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86eb3b810/8397bfeb776d4278a6c40f2eeb523bfa/FLAG9dd0996e9 [2019-12-27 07:36:14,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86eb3b810/8397bfeb776d4278a6c40f2eeb523bfa [2019-12-27 07:36:14,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:36:14,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:36:14,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:36:14,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:36:14,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:36:14,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:36:14" (1/1) ... [2019-12-27 07:36:14,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47349806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:14, skipping insertion in model container [2019-12-27 07:36:14,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:36:14" (1/1) ... [2019-12-27 07:36:14,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:36:14,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:36:15,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:36:15,352 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:36:15,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:36:15,595 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:36:15,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15 WrapperNode [2019-12-27 07:36:15,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:36:15,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:36:15,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:36:15,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:36:15,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... [2019-12-27 07:36:15,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... [2019-12-27 07:36:15,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:36:15,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:36:15,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:36:15,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:36:15,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... [2019-12-27 07:36:15,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... [2019-12-27 07:36:15,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... [2019-12-27 07:36:15,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... [2019-12-27 07:36:15,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... [2019-12-27 07:36:15,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... [2019-12-27 07:36:15,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... [2019-12-27 07:36:15,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:36:15,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:36:15,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:36:15,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:36:15,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:36:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:36:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:36:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:36:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:36:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:36:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:36:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:36:15,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:36:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:36:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:36:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:36:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:36:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:36:15,881 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:36:16,670 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:36:16,670 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:36:16,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:36:16 BoogieIcfgContainer [2019-12-27 07:36:16,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:36:16,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:36:16,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:36:16,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:36:16,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:36:14" (1/3) ... [2019-12-27 07:36:16,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5296d64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:36:16, skipping insertion in model container [2019-12-27 07:36:16,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:36:15" (2/3) ... [2019-12-27 07:36:16,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5296d64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:36:16, skipping insertion in model container [2019-12-27 07:36:16,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:36:16" (3/3) ... [2019-12-27 07:36:16,682 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2019-12-27 07:36:16,693 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:36:16,694 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:36:16,702 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:36:16,703 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:36:16,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,790 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,790 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,805 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,806 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,809 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:36:16,826 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:36:16,846 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:36:16,846 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:36:16,846 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:36:16,846 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:36:16,847 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:36:16,847 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:36:16,847 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:36:16,847 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:36:16,864 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 07:36:16,866 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:36:16,965 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:36:16,966 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:36:16,982 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:36:17,005 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:36:17,057 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:36:17,058 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:36:17,065 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:36:17,084 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 07:36:17,085 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:36:20,068 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:36:20,183 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:36:20,209 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81758 [2019-12-27 07:36:20,209 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 07:36:20,213 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-27 07:36:38,824 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117812 states. [2019-12-27 07:36:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 117812 states. [2019-12-27 07:36:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:36:38,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:38,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:36:38,835 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:38,843 INFO L82 PathProgramCache]: Analyzing trace with hash 839664, now seen corresponding path program 1 times [2019-12-27 07:36:38,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:38,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999968408] [2019-12-27 07:36:38,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:39,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999968408] [2019-12-27 07:36:39,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:39,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:36:39,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093161012] [2019-12-27 07:36:39,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:36:39,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:39,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:36:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:39,077 INFO L87 Difference]: Start difference. First operand 117812 states. Second operand 3 states. [2019-12-27 07:36:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:36:40,276 INFO L93 Difference]: Finished difference Result 117510 states and 507540 transitions. [2019-12-27 07:36:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:36:40,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:36:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:36:44,191 INFO L225 Difference]: With dead ends: 117510 [2019-12-27 07:36:44,191 INFO L226 Difference]: Without dead ends: 115144 [2019-12-27 07:36:44,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:36:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115144 states. [2019-12-27 07:36:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115144 to 115144. [2019-12-27 07:36:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115144 states. [2019-12-27 07:36:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115144 states to 115144 states and 497894 transitions. [2019-12-27 07:36:55,732 INFO L78 Accepts]: Start accepts. Automaton has 115144 states and 497894 transitions. Word has length 3 [2019-12-27 07:36:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:36:55,732 INFO L462 AbstractCegarLoop]: Abstraction has 115144 states and 497894 transitions. [2019-12-27 07:36:55,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:36:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 115144 states and 497894 transitions. [2019-12-27 07:36:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:36:55,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:36:55,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:36:55,738 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:36:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:36:55,739 INFO L82 PathProgramCache]: Analyzing trace with hash -79799111, now seen corresponding path program 1 times [2019-12-27 07:36:55,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:36:55,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558534329] [2019-12-27 07:36:55,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:36:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:36:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:36:55,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558534329] [2019-12-27 07:36:55,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:36:55,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:36:55,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102258380] [2019-12-27 07:36:55,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:36:55,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:36:55,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:36:55,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:36:55,854 INFO L87 Difference]: Start difference. First operand 115144 states and 497894 transitions. Second operand 4 states. [2019-12-27 07:37:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:01,821 INFO L93 Difference]: Finished difference Result 185114 states and 767412 transitions. [2019-12-27 07:37:01,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:37:01,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:37:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:02,449 INFO L225 Difference]: With dead ends: 185114 [2019-12-27 07:37:02,450 INFO L226 Difference]: Without dead ends: 185065 [2019-12-27 07:37:02,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:07,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185065 states. [2019-12-27 07:37:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185065 to 169989. [2019-12-27 07:37:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169989 states. [2019-12-27 07:37:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169989 states to 169989 states and 713980 transitions. [2019-12-27 07:37:11,725 INFO L78 Accepts]: Start accepts. Automaton has 169989 states and 713980 transitions. Word has length 11 [2019-12-27 07:37:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:11,726 INFO L462 AbstractCegarLoop]: Abstraction has 169989 states and 713980 transitions. [2019-12-27 07:37:11,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:37:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 169989 states and 713980 transitions. [2019-12-27 07:37:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:37:11,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:11,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:11,734 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash -676042940, now seen corresponding path program 1 times [2019-12-27 07:37:11,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:11,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462228839] [2019-12-27 07:37:11,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:11,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462228839] [2019-12-27 07:37:11,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:11,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:11,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020953488] [2019-12-27 07:37:11,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:37:11,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:11,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:37:11,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:37:11,822 INFO L87 Difference]: Start difference. First operand 169989 states and 713980 transitions. Second operand 4 states. [2019-12-27 07:37:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:18,516 INFO L93 Difference]: Finished difference Result 241878 states and 992054 transitions. [2019-12-27 07:37:18,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:37:18,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:37:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:20,104 INFO L225 Difference]: With dead ends: 241878 [2019-12-27 07:37:20,105 INFO L226 Difference]: Without dead ends: 241815 [2019-12-27 07:37:20,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241815 states. [2019-12-27 07:37:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241815 to 205075. [2019-12-27 07:37:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205075 states. [2019-12-27 07:37:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205075 states to 205075 states and 855408 transitions. [2019-12-27 07:37:41,480 INFO L78 Accepts]: Start accepts. Automaton has 205075 states and 855408 transitions. Word has length 13 [2019-12-27 07:37:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:41,480 INFO L462 AbstractCegarLoop]: Abstraction has 205075 states and 855408 transitions. [2019-12-27 07:37:41,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:37:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 205075 states and 855408 transitions. [2019-12-27 07:37:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:37:41,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:41,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:41,484 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:41,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1689712693, now seen corresponding path program 1 times [2019-12-27 07:37:41,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:41,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037045875] [2019-12-27 07:37:41,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:41,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037045875] [2019-12-27 07:37:41,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:41,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:41,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883674672] [2019-12-27 07:37:41,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:41,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:41,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:41,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:41,591 INFO L87 Difference]: Start difference. First operand 205075 states and 855408 transitions. Second operand 3 states. [2019-12-27 07:37:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:41,723 INFO L93 Difference]: Finished difference Result 40406 states and 132180 transitions. [2019-12-27 07:37:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:41,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:37:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:41,798 INFO L225 Difference]: With dead ends: 40406 [2019-12-27 07:37:41,798 INFO L226 Difference]: Without dead ends: 40406 [2019-12-27 07:37:41,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:42,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40406 states. [2019-12-27 07:37:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40406 to 40406. [2019-12-27 07:37:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40406 states. [2019-12-27 07:37:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40406 states to 40406 states and 132180 transitions. [2019-12-27 07:37:42,512 INFO L78 Accepts]: Start accepts. Automaton has 40406 states and 132180 transitions. Word has length 13 [2019-12-27 07:37:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:42,512 INFO L462 AbstractCegarLoop]: Abstraction has 40406 states and 132180 transitions. [2019-12-27 07:37:42,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 40406 states and 132180 transitions. [2019-12-27 07:37:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:37:42,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:42,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:42,518 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:42,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:42,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1531561803, now seen corresponding path program 1 times [2019-12-27 07:37:42,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:42,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529393152] [2019-12-27 07:37:42,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:42,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529393152] [2019-12-27 07:37:42,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:42,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:37:42,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216645222] [2019-12-27 07:37:42,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:37:42,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:37:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:42,611 INFO L87 Difference]: Start difference. First operand 40406 states and 132180 transitions. Second operand 5 states. [2019-12-27 07:37:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:44,948 INFO L93 Difference]: Finished difference Result 54550 states and 174566 transitions. [2019-12-27 07:37:44,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:37:44,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:37:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:45,039 INFO L225 Difference]: With dead ends: 54550 [2019-12-27 07:37:45,039 INFO L226 Difference]: Without dead ends: 54537 [2019-12-27 07:37:45,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:37:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54537 states. [2019-12-27 07:37:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54537 to 40777. [2019-12-27 07:37:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40777 states. [2019-12-27 07:37:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40777 states to 40777 states and 133064 transitions. [2019-12-27 07:37:45,824 INFO L78 Accepts]: Start accepts. Automaton has 40777 states and 133064 transitions. Word has length 19 [2019-12-27 07:37:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:45,824 INFO L462 AbstractCegarLoop]: Abstraction has 40777 states and 133064 transitions. [2019-12-27 07:37:45,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:37:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 40777 states and 133064 transitions. [2019-12-27 07:37:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:37:45,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:45,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:45,835 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1034032563, now seen corresponding path program 1 times [2019-12-27 07:37:45,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:45,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725062180] [2019-12-27 07:37:45,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:45,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725062180] [2019-12-27 07:37:45,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:45,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:37:45,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169223991] [2019-12-27 07:37:45,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:37:45,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:45,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:37:45,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:37:45,906 INFO L87 Difference]: Start difference. First operand 40777 states and 133064 transitions. Second operand 4 states. [2019-12-27 07:37:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:45,952 INFO L93 Difference]: Finished difference Result 7638 states and 20735 transitions. [2019-12-27 07:37:45,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:37:45,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:37:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:45,966 INFO L225 Difference]: With dead ends: 7638 [2019-12-27 07:37:45,966 INFO L226 Difference]: Without dead ends: 7638 [2019-12-27 07:37:45,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:37:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2019-12-27 07:37:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 7498. [2019-12-27 07:37:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7498 states. [2019-12-27 07:37:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 20363 transitions. [2019-12-27 07:37:46,102 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 20363 transitions. Word has length 25 [2019-12-27 07:37:46,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:46,102 INFO L462 AbstractCegarLoop]: Abstraction has 7498 states and 20363 transitions. [2019-12-27 07:37:46,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:37:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 20363 transitions. [2019-12-27 07:37:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:37:46,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:46,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:46,113 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:46,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2065802623, now seen corresponding path program 1 times [2019-12-27 07:37:46,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:46,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814569197] [2019-12-27 07:37:46,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:46,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814569197] [2019-12-27 07:37:46,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:46,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:37:46,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355041420] [2019-12-27 07:37:46,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:37:46,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:37:46,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:46,240 INFO L87 Difference]: Start difference. First operand 7498 states and 20363 transitions. Second operand 5 states. [2019-12-27 07:37:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:46,282 INFO L93 Difference]: Finished difference Result 5405 states and 15353 transitions. [2019-12-27 07:37:46,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:37:46,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:37:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:46,292 INFO L225 Difference]: With dead ends: 5405 [2019-12-27 07:37:46,292 INFO L226 Difference]: Without dead ends: 5025 [2019-12-27 07:37:46,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-27 07:37:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-27 07:37:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-27 07:37:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13441 transitions. [2019-12-27 07:37:46,411 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13441 transitions. Word has length 37 [2019-12-27 07:37:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:46,412 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13441 transitions. [2019-12-27 07:37:46,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:37:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13441 transitions. [2019-12-27 07:37:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:46,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:46,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:46,424 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1806952947, now seen corresponding path program 1 times [2019-12-27 07:37:46,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:46,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640012557] [2019-12-27 07:37:46,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:46,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640012557] [2019-12-27 07:37:46,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:46,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:37:46,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380999246] [2019-12-27 07:37:46,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:46,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:46,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:46,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:46,533 INFO L87 Difference]: Start difference. First operand 4661 states and 13441 transitions. Second operand 3 states. [2019-12-27 07:37:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:46,597 INFO L93 Difference]: Finished difference Result 4670 states and 13455 transitions. [2019-12-27 07:37:46,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:46,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:37:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:46,606 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:37:46,606 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:37:46,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:37:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:37:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:37:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13451 transitions. [2019-12-27 07:37:48,232 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13451 transitions. Word has length 65 [2019-12-27 07:37:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:48,232 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13451 transitions. [2019-12-27 07:37:48,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13451 transitions. [2019-12-27 07:37:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:48,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:48,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:48,242 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:48,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:48,242 INFO L82 PathProgramCache]: Analyzing trace with hash -736030129, now seen corresponding path program 1 times [2019-12-27 07:37:48,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:48,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855930009] [2019-12-27 07:37:48,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:48,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855930009] [2019-12-27 07:37:48,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:48,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:37:48,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282163434] [2019-12-27 07:37:48,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:48,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:48,313 INFO L87 Difference]: Start difference. First operand 4666 states and 13451 transitions. Second operand 3 states. [2019-12-27 07:37:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:48,378 INFO L93 Difference]: Finished difference Result 4670 states and 13445 transitions. [2019-12-27 07:37:48,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:48,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:37:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:48,387 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:37:48,388 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:37:48,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:37:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:37:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:37:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13441 transitions. [2019-12-27 07:37:48,482 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13441 transitions. Word has length 65 [2019-12-27 07:37:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:48,482 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13441 transitions. [2019-12-27 07:37:48,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13441 transitions. [2019-12-27 07:37:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:48,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:48,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:48,491 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:48,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:48,491 INFO L82 PathProgramCache]: Analyzing trace with hash -743654703, now seen corresponding path program 1 times [2019-12-27 07:37:48,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:48,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292251588] [2019-12-27 07:37:48,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:48,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292251588] [2019-12-27 07:37:48,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:48,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:37:48,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354303096] [2019-12-27 07:37:48,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:37:48,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:37:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:48,601 INFO L87 Difference]: Start difference. First operand 4666 states and 13441 transitions. Second operand 5 states. [2019-12-27 07:37:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:48,915 INFO L93 Difference]: Finished difference Result 7090 states and 20230 transitions. [2019-12-27 07:37:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:37:48,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:37:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:48,925 INFO L225 Difference]: With dead ends: 7090 [2019-12-27 07:37:48,925 INFO L226 Difference]: Without dead ends: 7090 [2019-12-27 07:37:48,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:37:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2019-12-27 07:37:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 5981. [2019-12-27 07:37:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5981 states. [2019-12-27 07:37:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5981 states to 5981 states and 17235 transitions. [2019-12-27 07:37:49,021 INFO L78 Accepts]: Start accepts. Automaton has 5981 states and 17235 transitions. Word has length 65 [2019-12-27 07:37:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:49,021 INFO L462 AbstractCegarLoop]: Abstraction has 5981 states and 17235 transitions. [2019-12-27 07:37:49,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:37:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 5981 states and 17235 transitions. [2019-12-27 07:37:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:49,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:49,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:49,029 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:49,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:49,030 INFO L82 PathProgramCache]: Analyzing trace with hash 326503145, now seen corresponding path program 2 times [2019-12-27 07:37:49,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:49,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103949221] [2019-12-27 07:37:49,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:49,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103949221] [2019-12-27 07:37:49,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:49,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:37:49,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788482439] [2019-12-27 07:37:49,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:37:49,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:37:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:37:49,136 INFO L87 Difference]: Start difference. First operand 5981 states and 17235 transitions. Second operand 5 states. [2019-12-27 07:37:49,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:49,465 INFO L93 Difference]: Finished difference Result 9069 states and 25840 transitions. [2019-12-27 07:37:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:37:49,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:37:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:49,476 INFO L225 Difference]: With dead ends: 9069 [2019-12-27 07:37:49,477 INFO L226 Difference]: Without dead ends: 9069 [2019-12-27 07:37:49,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:37:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9069 states. [2019-12-27 07:37:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9069 to 6733. [2019-12-27 07:37:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6733 states. [2019-12-27 07:37:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 19502 transitions. [2019-12-27 07:37:49,585 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 19502 transitions. Word has length 65 [2019-12-27 07:37:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:49,585 INFO L462 AbstractCegarLoop]: Abstraction has 6733 states and 19502 transitions. [2019-12-27 07:37:49,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:37:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 19502 transitions. [2019-12-27 07:37:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:49,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:49,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:49,595 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:49,596 INFO L82 PathProgramCache]: Analyzing trace with hash 737396099, now seen corresponding path program 3 times [2019-12-27 07:37:49,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:49,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084440338] [2019-12-27 07:37:49,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:49,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084440338] [2019-12-27 07:37:49,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:49,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:37:49,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171689655] [2019-12-27 07:37:49,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:37:49,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:49,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:37:49,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:37:49,694 INFO L87 Difference]: Start difference. First operand 6733 states and 19502 transitions. Second operand 6 states. [2019-12-27 07:37:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:50,234 INFO L93 Difference]: Finished difference Result 10887 states and 31295 transitions. [2019-12-27 07:37:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:37:50,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:37:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:50,252 INFO L225 Difference]: With dead ends: 10887 [2019-12-27 07:37:50,252 INFO L226 Difference]: Without dead ends: 10887 [2019-12-27 07:37:50,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:37:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-12-27 07:37:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 7256. [2019-12-27 07:37:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7256 states. [2019-12-27 07:37:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 21081 transitions. [2019-12-27 07:37:50,435 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 21081 transitions. Word has length 65 [2019-12-27 07:37:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:50,436 INFO L462 AbstractCegarLoop]: Abstraction has 7256 states and 21081 transitions. [2019-12-27 07:37:50,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:37:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 21081 transitions. [2019-12-27 07:37:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:37:50,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:50,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:50,451 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash 156309423, now seen corresponding path program 4 times [2019-12-27 07:37:50,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:50,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69234516] [2019-12-27 07:37:50,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:50,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69234516] [2019-12-27 07:37:50,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:50,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:50,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119208745] [2019-12-27 07:37:50,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:50,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:50,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:50,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:50,600 INFO L87 Difference]: Start difference. First operand 7256 states and 21081 transitions. Second operand 3 states. [2019-12-27 07:37:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:50,671 INFO L93 Difference]: Finished difference Result 7256 states and 21080 transitions. [2019-12-27 07:37:50,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:50,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:37:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:50,683 INFO L225 Difference]: With dead ends: 7256 [2019-12-27 07:37:50,684 INFO L226 Difference]: Without dead ends: 7256 [2019-12-27 07:37:50,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2019-12-27 07:37:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 4657. [2019-12-27 07:37:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-12-27 07:37:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 13801 transitions. [2019-12-27 07:37:50,772 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 13801 transitions. Word has length 65 [2019-12-27 07:37:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:50,772 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 13801 transitions. [2019-12-27 07:37:50,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 13801 transitions. [2019-12-27 07:37:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:37:50,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:50,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:50,779 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash 939416227, now seen corresponding path program 1 times [2019-12-27 07:37:50,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:50,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634292392] [2019-12-27 07:37:50,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:50,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634292392] [2019-12-27 07:37:50,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:50,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:50,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215660638] [2019-12-27 07:37:50,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:50,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:50,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:50,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:50,842 INFO L87 Difference]: Start difference. First operand 4657 states and 13801 transitions. Second operand 3 states. [2019-12-27 07:37:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:50,869 INFO L93 Difference]: Finished difference Result 4277 states and 12382 transitions. [2019-12-27 07:37:50,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:50,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:37:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:50,876 INFO L225 Difference]: With dead ends: 4277 [2019-12-27 07:37:50,876 INFO L226 Difference]: Without dead ends: 4277 [2019-12-27 07:37:50,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4277 states. [2019-12-27 07:37:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4277 to 3561. [2019-12-27 07:37:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-12-27 07:37:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 10350 transitions. [2019-12-27 07:37:50,956 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 10350 transitions. Word has length 66 [2019-12-27 07:37:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:50,956 INFO L462 AbstractCegarLoop]: Abstraction has 3561 states and 10350 transitions. [2019-12-27 07:37:50,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 10350 transitions. [2019-12-27 07:37:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:37:50,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:50,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:50,970 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:50,970 INFO L82 PathProgramCache]: Analyzing trace with hash -9053315, now seen corresponding path program 1 times [2019-12-27 07:37:50,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:50,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441975780] [2019-12-27 07:37:50,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:51,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441975780] [2019-12-27 07:37:51,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:51,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:37:51,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897040827] [2019-12-27 07:37:51,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:37:51,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:51,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:37:51,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:37:51,071 INFO L87 Difference]: Start difference. First operand 3561 states and 10350 transitions. Second operand 6 states. [2019-12-27 07:37:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:51,624 INFO L93 Difference]: Finished difference Result 6091 states and 17309 transitions. [2019-12-27 07:37:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:37:51,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 07:37:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:51,639 INFO L225 Difference]: With dead ends: 6091 [2019-12-27 07:37:51,640 INFO L226 Difference]: Without dead ends: 6091 [2019-12-27 07:37:51,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:37:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2019-12-27 07:37:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3561. [2019-12-27 07:37:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-12-27 07:37:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 10350 transitions. [2019-12-27 07:37:51,789 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 10350 transitions. Word has length 67 [2019-12-27 07:37:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:51,790 INFO L462 AbstractCegarLoop]: Abstraction has 3561 states and 10350 transitions. [2019-12-27 07:37:51,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:37:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 10350 transitions. [2019-12-27 07:37:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:37:51,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:51,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:51,800 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:51,800 INFO L82 PathProgramCache]: Analyzing trace with hash -631043911, now seen corresponding path program 2 times [2019-12-27 07:37:51,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:51,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314327926] [2019-12-27 07:37:51,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:51,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314327926] [2019-12-27 07:37:51,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:51,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:37:51,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650907347] [2019-12-27 07:37:51,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:37:51,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:37:51,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:37:51,932 INFO L87 Difference]: Start difference. First operand 3561 states and 10350 transitions. Second operand 6 states. [2019-12-27 07:37:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:52,007 INFO L93 Difference]: Finished difference Result 6072 states and 17644 transitions. [2019-12-27 07:37:52,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:37:52,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 07:37:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:52,013 INFO L225 Difference]: With dead ends: 6072 [2019-12-27 07:37:52,014 INFO L226 Difference]: Without dead ends: 3227 [2019-12-27 07:37:52,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:37:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2019-12-27 07:37:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3227. [2019-12-27 07:37:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3227 states. [2019-12-27 07:37:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 9368 transitions. [2019-12-27 07:37:52,068 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 9368 transitions. Word has length 67 [2019-12-27 07:37:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:52,069 INFO L462 AbstractCegarLoop]: Abstraction has 3227 states and 9368 transitions. [2019-12-27 07:37:52,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:37:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 9368 transitions. [2019-12-27 07:37:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:37:52,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:52,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:52,075 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1684577121, now seen corresponding path program 3 times [2019-12-27 07:37:52,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:52,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148801866] [2019-12-27 07:37:52,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:52,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148801866] [2019-12-27 07:37:52,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:52,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:37:52,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589435271] [2019-12-27 07:37:52,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:37:52,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:52,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:37:52,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:52,155 INFO L87 Difference]: Start difference. First operand 3227 states and 9368 transitions. Second operand 3 states. [2019-12-27 07:37:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:52,182 INFO L93 Difference]: Finished difference Result 3051 states and 8579 transitions. [2019-12-27 07:37:52,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:37:52,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:37:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:52,187 INFO L225 Difference]: With dead ends: 3051 [2019-12-27 07:37:52,188 INFO L226 Difference]: Without dead ends: 3051 [2019-12-27 07:37:52,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:37:52,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2019-12-27 07:37:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2817. [2019-12-27 07:37:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-12-27 07:37:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7940 transitions. [2019-12-27 07:37:52,258 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7940 transitions. Word has length 67 [2019-12-27 07:37:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:52,259 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7940 transitions. [2019-12-27 07:37:52,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:37:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7940 transitions. [2019-12-27 07:37:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:37:52,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:52,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:52,266 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash -539233385, now seen corresponding path program 1 times [2019-12-27 07:37:52,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:52,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555020134] [2019-12-27 07:37:52,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:52,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555020134] [2019-12-27 07:37:52,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:52,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:37:52,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022141806] [2019-12-27 07:37:52,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:37:52,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:52,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:37:52,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:37:52,657 INFO L87 Difference]: Start difference. First operand 2817 states and 7940 transitions. Second operand 16 states. [2019-12-27 07:37:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:53,875 INFO L93 Difference]: Finished difference Result 5870 states and 16395 transitions. [2019-12-27 07:37:53,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 07:37:53,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-27 07:37:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:53,884 INFO L225 Difference]: With dead ends: 5870 [2019-12-27 07:37:53,884 INFO L226 Difference]: Without dead ends: 5838 [2019-12-27 07:37:53,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 07:37:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5838 states. [2019-12-27 07:37:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5838 to 4141. [2019-12-27 07:37:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2019-12-27 07:37:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 11575 transitions. [2019-12-27 07:37:53,947 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 11575 transitions. Word has length 68 [2019-12-27 07:37:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:53,947 INFO L462 AbstractCegarLoop]: Abstraction has 4141 states and 11575 transitions. [2019-12-27 07:37:53,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:37:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 11575 transitions. [2019-12-27 07:37:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:37:53,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:53,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:53,951 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:53,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:53,951 INFO L82 PathProgramCache]: Analyzing trace with hash -233642199, now seen corresponding path program 2 times [2019-12-27 07:37:53,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:53,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73762641] [2019-12-27 07:37:53,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:54,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73762641] [2019-12-27 07:37:54,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:54,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:37:54,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352648338] [2019-12-27 07:37:54,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:37:54,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:54,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:37:54,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:37:54,132 INFO L87 Difference]: Start difference. First operand 4141 states and 11575 transitions. Second operand 12 states. [2019-12-27 07:37:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:54,533 INFO L93 Difference]: Finished difference Result 6476 states and 18000 transitions. [2019-12-27 07:37:54,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:37:54,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 07:37:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:54,542 INFO L225 Difference]: With dead ends: 6476 [2019-12-27 07:37:54,543 INFO L226 Difference]: Without dead ends: 6444 [2019-12-27 07:37:54,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:37:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6444 states. [2019-12-27 07:37:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6444 to 4468. [2019-12-27 07:37:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4468 states. [2019-12-27 07:37:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 12514 transitions. [2019-12-27 07:37:54,610 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 12514 transitions. Word has length 68 [2019-12-27 07:37:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:54,610 INFO L462 AbstractCegarLoop]: Abstraction has 4468 states and 12514 transitions. [2019-12-27 07:37:54,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:37:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 12514 transitions. [2019-12-27 07:37:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:37:54,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:54,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:54,615 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1643062481, now seen corresponding path program 3 times [2019-12-27 07:37:54,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:54,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388857014] [2019-12-27 07:37:54,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:37:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:37:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:37:55,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388857014] [2019-12-27 07:37:55,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:37:55,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 07:37:55,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64613249] [2019-12-27 07:37:55,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 07:37:55,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:37:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 07:37:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:37:55,475 INFO L87 Difference]: Start difference. First operand 4468 states and 12514 transitions. Second operand 20 states. [2019-12-27 07:37:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:37:59,833 INFO L93 Difference]: Finished difference Result 14046 states and 39095 transitions. [2019-12-27 07:37:59,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 07:37:59,833 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 07:37:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:37:59,851 INFO L225 Difference]: With dead ends: 14046 [2019-12-27 07:37:59,851 INFO L226 Difference]: Without dead ends: 14014 [2019-12-27 07:37:59,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=625, Invalid=3931, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 07:37:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14014 states. [2019-12-27 07:37:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14014 to 4649. [2019-12-27 07:37:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4649 states. [2019-12-27 07:37:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 13015 transitions. [2019-12-27 07:37:59,966 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 13015 transitions. Word has length 68 [2019-12-27 07:37:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:37:59,966 INFO L462 AbstractCegarLoop]: Abstraction has 4649 states and 13015 transitions. [2019-12-27 07:37:59,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 07:37:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 13015 transitions. [2019-12-27 07:37:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:37:59,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:37:59,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:37:59,973 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:37:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:37:59,974 INFO L82 PathProgramCache]: Analyzing trace with hash -691349817, now seen corresponding path program 4 times [2019-12-27 07:37:59,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:37:59,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005317817] [2019-12-27 07:37:59,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:38:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:38:00,092 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:38:00,092 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:38:00,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= v_~z$w_buff0_used~0_115 0) (= 0 v_~z$r_buff1_thd0~0_47) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2025~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2025~0.base_21|) |v_ULTIMATE.start_main_~#t2025~0.offset_17| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_10 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t2025~0.base_21|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z~0_28 0) (= v_~z$r_buff0_thd3~0_20 0) (= 0 v_~z$w_buff0~0_27) (= 0 |v_ULTIMATE.start_main_~#t2025~0.offset_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2025~0.base_21|) 0) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2025~0.base_21| 4) |v_#length_25|) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= |v_#NULL.offset_5| 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t2025~0.base_21| 1)) (= v_~__unbuffered_p2_EAX~0_9 0) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 |v_#NULL.base_5|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_~#t2026~0.base=|v_ULTIMATE.start_main_~#t2026~0.base_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ULTIMATE.start_main_~#t2026~0.offset=|v_ULTIMATE.start_main_~#t2026~0.offset_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_~#t2027~0.base=|v_ULTIMATE.start_main_~#t2027~0.base_20|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_12, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_~#t2025~0.offset=|v_ULTIMATE.start_main_~#t2025~0.offset_17|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_27, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t2025~0.base=|v_ULTIMATE.start_main_~#t2025~0.base_21|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ULTIMATE.start_main_~#t2027~0.offset=|v_ULTIMATE.start_main_~#t2027~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2026~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2026~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2027~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2025~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2025~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t2027~0.offset] because there is no mapped edge [2019-12-27 07:38:00,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2026~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2026~0.base_12|) |v_ULTIMATE.start_main_~#t2026~0.offset_11| 1))) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2026~0.base_12| 4)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2026~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2026~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t2026~0.offset_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2026~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2026~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2026~0.base=|v_ULTIMATE.start_main_~#t2026~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2026~0.offset=|v_ULTIMATE.start_main_~#t2026~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2026~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t2026~0.offset, #length] because there is no mapped edge [2019-12-27 07:38:00,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_60 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_17) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_18) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_93 v_~z$w_buff1_used~0_60) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_92 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_18, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 07:38:00,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2027~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2027~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2027~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2027~0.base_9|) |v_ULTIMATE.start_main_~#t2027~0.offset_8| 2))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2027~0.base_9| 4) |v_#length_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2027~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t2027~0.offset_8|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2027~0.base_9| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2027~0.base=|v_ULTIMATE.start_main_~#t2027~0.base_9|, ULTIMATE.start_main_~#t2027~0.offset=|v_ULTIMATE.start_main_~#t2027~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2027~0.base, ULTIMATE.start_main_~#t2027~0.offset] because there is no mapped edge [2019-12-27 07:38:00,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-725810734 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-725810734 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-725810734|) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-725810734| ~z$w_buff0_used~0_In-725810734) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-725810734, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-725810734} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-725810734|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-725810734, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-725810734} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:38:00,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In115335780 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In115335780 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In115335780 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In115335780 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out115335780|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In115335780 |P0Thread1of1ForFork0_#t~ite6_Out115335780|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In115335780, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In115335780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In115335780, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In115335780} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out115335780|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In115335780, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In115335780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In115335780, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In115335780} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:38:00,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1253924548 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1253924548 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out1253924548 ~z$r_buff0_thd1~0_In1253924548) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out1253924548) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1253924548, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1253924548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1253924548, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1253924548|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1253924548} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:38:00,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1542598665 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1542598665 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1542598665 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1542598665 256)))) (or (and (= ~z$r_buff1_thd1~0_In-1542598665 |P0Thread1of1ForFork0_#t~ite8_Out-1542598665|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1542598665|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1542598665, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1542598665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1542598665, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1542598665} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1542598665, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1542598665|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1542598665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1542598665, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1542598665} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:38:00,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:38:00,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out1893883480| |P1Thread1of1ForFork1_#t~ite9_Out1893883480|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1893883480 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1893883480 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In1893883480 |P1Thread1of1ForFork1_#t~ite9_Out1893883480|) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In1893883480 |P1Thread1of1ForFork1_#t~ite9_Out1893883480|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1893883480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1893883480, ~z$w_buff1~0=~z$w_buff1~0_In1893883480, ~z~0=~z~0_In1893883480} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1893883480|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1893883480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1893883480, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1893883480|, ~z$w_buff1~0=~z$w_buff1~0_In1893883480, ~z~0=~z~0_In1893883480} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 07:38:00,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-335902371 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-335902371 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-335902371| ~z~0_In-335902371) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-335902371| ~z$w_buff1~0_In-335902371) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-335902371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-335902371, ~z$w_buff1~0=~z$w_buff1~0_In-335902371, ~z~0=~z~0_In-335902371} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-335902371|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-335902371, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-335902371, ~z$w_buff1~0=~z$w_buff1~0_In-335902371, ~z~0=~z~0_In-335902371} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:38:00,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_17, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 07:38:00,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1809317862 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1809317862 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out1809317862| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out1809317862| ~z$w_buff0_used~0_In1809317862) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1809317862, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1809317862} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1809317862, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1809317862, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1809317862|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:38:00,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In1345623031 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1345623031 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1345623031 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1345623031 256)))) (or (and (= ~z$w_buff1_used~0_In1345623031 |P2Thread1of1ForFork2_#t~ite18_Out1345623031|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1345623031|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1345623031, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1345623031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1345623031, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1345623031} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1345623031, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1345623031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1345623031, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1345623031, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1345623031|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:38:00,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1964907892 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1964907892 256)))) (or (and (= ~z$r_buff0_thd3~0_In1964907892 |P2Thread1of1ForFork2_#t~ite19_Out1964907892|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1964907892|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1964907892, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964907892} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1964907892, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964907892, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1964907892|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:38:00,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In1708926076 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1708926076 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1708926076 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1708926076 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1708926076|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In1708926076 |P2Thread1of1ForFork2_#t~ite20_Out1708926076|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1708926076, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1708926076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708926076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1708926076} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1708926076, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1708926076|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1708926076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708926076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1708926076} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:38:00,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_13) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:38:00,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-182247395 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-182247395 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-182247395| ~z$w_buff0_used~0_In-182247395)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-182247395| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-182247395, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-182247395} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-182247395, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-182247395|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-182247395} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:38:00,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2120354145 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-2120354145 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-2120354145 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2120354145 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-2120354145| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite12_Out-2120354145| ~z$w_buff1_used~0_In-2120354145)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120354145, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2120354145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2120354145, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2120354145} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120354145, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2120354145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2120354145, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2120354145|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2120354145} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:38:00,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In325181871 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In325181871 256)))) (or (and (= ~z$r_buff0_thd2~0_In325181871 |P1Thread1of1ForFork1_#t~ite13_Out325181871|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out325181871|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In325181871, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In325181871} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In325181871, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out325181871|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In325181871} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:38:00,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-136773994 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-136773994 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-136773994 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-136773994 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-136773994|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-136773994 |P1Thread1of1ForFork1_#t~ite14_Out-136773994|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-136773994, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-136773994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136773994, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-136773994} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-136773994, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-136773994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136773994, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-136773994|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-136773994} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:38:00,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:38:00,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:38:00,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In2123068771 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2123068771 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out2123068771| |ULTIMATE.start_main_#t~ite24_Out2123068771|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In2123068771 |ULTIMATE.start_main_#t~ite24_Out2123068771|)) (and (not .cse1) (= ~z$w_buff1~0_In2123068771 |ULTIMATE.start_main_#t~ite24_Out2123068771|) (not .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2123068771, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123068771, ~z$w_buff1~0=~z$w_buff1~0_In2123068771, ~z~0=~z~0_In2123068771} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2123068771, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out2123068771|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2123068771, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out2123068771|, ~z$w_buff1~0=~z$w_buff1~0_In2123068771, ~z~0=~z~0_In2123068771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 07:38:00,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1742351149 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1742351149 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-1742351149| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1742351149 |ULTIMATE.start_main_#t~ite26_Out-1742351149|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1742351149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1742351149} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1742351149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1742351149, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1742351149|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:38:00,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In436849077 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In436849077 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In436849077 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In436849077 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out436849077| ~z$w_buff1_used~0_In436849077) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out436849077|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In436849077, ~z$w_buff0_used~0=~z$w_buff0_used~0_In436849077, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In436849077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In436849077} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In436849077, ~z$w_buff0_used~0=~z$w_buff0_used~0_In436849077, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In436849077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In436849077, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out436849077|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:38:00,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1640412989 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1640412989 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1640412989 |ULTIMATE.start_main_#t~ite28_Out-1640412989|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out-1640412989|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1640412989, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1640412989} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1640412989, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1640412989|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1640412989} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:38:00,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In932161931 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In932161931 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In932161931 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In932161931 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In932161931 |ULTIMATE.start_main_#t~ite29_Out932161931|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite29_Out932161931|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In932161931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In932161931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In932161931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In932161931} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In932161931, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out932161931|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In932161931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In932161931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In932161931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:38:00,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_55 v_~z$r_buff0_thd0~0_54)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_54, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:38:00,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L834-->L837-1: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:38:00,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:38:00,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:38:00 BasicIcfg [2019-12-27 07:38:00,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:38:00,200 INFO L168 Benchmark]: Toolchain (without parser) took 105456.40 ms. Allocated memory was 144.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 893.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:00,201 INFO L168 Benchmark]: CDTParser took 1.46 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:38:00,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.50 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 153.4 MB in the end (delta: -52.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:00,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.45 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:00,203 INFO L168 Benchmark]: Boogie Preprocessor took 83.06 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 147.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:00,203 INFO L168 Benchmark]: RCFGBuilder took 875.79 ms. Allocated memory is still 201.9 MB. Free memory was 147.8 MB in the beginning and 97.5 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:00,204 INFO L168 Benchmark]: TraceAbstraction took 103525.05 ms. Allocated memory was 201.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 832.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:38:00,208 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 850.50 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 153.4 MB in the end (delta: -52.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 116.45 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.06 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 147.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.79 ms. Allocated memory is still 201.9 MB. Free memory was 147.8 MB in the beginning and 97.5 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103525.05 ms. Allocated memory was 201.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 832.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5870 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81758 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3050 SDtfs, 3281 SDslu, 8302 SDs, 0 SdLazy, 7091 SolverSat, 293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 30 SyntacticMatches, 18 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205075occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 92281 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 962 ConstructedInterpolants, 0 QuantifiedInterpolants, 257373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...