/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/mix048_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:40:43,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:40:43,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:40:43,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:40:43,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:40:43,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:40:43,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:40:43,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:40:43,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:40:43,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:40:43,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:40:43,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:40:43,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:40:43,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:40:43,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:40:43,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:40:43,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:40:43,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:40:43,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:40:43,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:40:43,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:40:43,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:40:43,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:40:43,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:40:43,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:40:43,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:40:43,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:40:43,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:40:43,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:40:43,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:40:43,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:40:43,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:40:43,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:40:43,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:40:43,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:40:43,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:40:43,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:40:43,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:40:43,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:40:43,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:40:43,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:40:43,551 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 06:40:43,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:40:43,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:40:43,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:40:43,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:40:43,579 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:40:43,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:40:43,579 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:40:43,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:40:43,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:40:43,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:40:43,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:40:43,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:40:43,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:40:43,581 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:40:43,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:40:43,581 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:40:43,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:40:43,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:40:43,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:40:43,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:40:43,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:40:43,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:40:43,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:40:43,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:40:43,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:40:43,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:40:43,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:40:43,583 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:40:43,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:40:43,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:40:43,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:40:43,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:40:43,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:40:43,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:40:43,876 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:40:43,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i [2019-12-27 06:40:43,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9bb203a4/5c70f137e3164b4a91e6cbfd281ced6d/FLAGee44f6ab0 [2019-12-27 06:40:44,512 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:40:44,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i [2019-12-27 06:40:44,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9bb203a4/5c70f137e3164b4a91e6cbfd281ced6d/FLAGee44f6ab0 [2019-12-27 06:40:44,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9bb203a4/5c70f137e3164b4a91e6cbfd281ced6d [2019-12-27 06:40:44,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:40:44,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:40:44,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:40:44,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:40:44,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:40:44,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:40:44" (1/1) ... [2019-12-27 06:40:44,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:44, skipping insertion in model container [2019-12-27 06:40:44,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:40:44" (1/1) ... [2019-12-27 06:40:44,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:40:44,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:40:45,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:40:45,332 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:40:45,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:40:45,532 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:40:45,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45 WrapperNode [2019-12-27 06:40:45,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:40:45,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:40:45,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:40:45,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:40:45,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (1/1) ... [2019-12-27 06:40:45,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (1/1) ... [2019-12-27 06:40:45,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:40:45,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:40:45,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:40:45,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:40:45,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (1/1) ... [2019-12-27 06:40:45,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (1/1) ... [2019-12-27 06:40:45,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (1/1) ... [2019-12-27 06:40:45,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (1/1) ... [2019-12-27 06:40:45,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (1/1) ... [2019-12-27 06:40:45,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (1/1) ... [2019-12-27 06:40:45,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (1/1) ... [2019-12-27 06:40:45,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:40:45,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:40:45,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:40:45,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:40:45,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (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 06:40:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:40:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:40:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:40:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:40:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:40:45,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:40:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:40:45,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:40:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:40:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:40:45,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:40:45,737 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 06:40:46,524 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:40:46,524 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:40:46,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:40:46 BoogieIcfgContainer [2019-12-27 06:40:46,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:40:46,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:40:46,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:40:46,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:40:46,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:40:44" (1/3) ... [2019-12-27 06:40:46,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cad0ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:40:46, skipping insertion in model container [2019-12-27 06:40:46,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:40:45" (2/3) ... [2019-12-27 06:40:46,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cad0ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:40:46, skipping insertion in model container [2019-12-27 06:40:46,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:40:46" (3/3) ... [2019-12-27 06:40:46,535 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_power.oepc.i [2019-12-27 06:40:46,545 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:40:46,545 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:40:46,554 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:40:46,555 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:40:46,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,605 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,605 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,654 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,654 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:40:46,679 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:40:46,700 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:40:46,700 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:40:46,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:40:46,700 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:40:46,701 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:40:46,701 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:40:46,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:40:46,701 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:40:46,718 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 06:40:46,720 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 06:40:46,809 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 06:40:46,810 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:40:46,825 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:40:46,844 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 06:40:46,891 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 06:40:46,891 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:40:46,898 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:40:46,913 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 06:40:46,914 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:40:50,291 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 06:40:50,395 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 06:40:50,425 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-27 06:40:50,426 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 06:40:50,429 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 06:40:50,861 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 06:40:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 06:40:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:40:50,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:50,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:40:50,878 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:50,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:50,886 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-27 06:40:50,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:50,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889960482] [2019-12-27 06:40:50,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:51,117 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 06:40:51,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889960482] [2019-12-27 06:40:51,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:51,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:40:51,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813885136] [2019-12-27 06:40:51,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:40:51,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:51,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:40:51,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:40:51,146 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 06:40:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:51,421 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-27 06:40:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:40:51,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:40:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:51,544 INFO L225 Difference]: With dead ends: 7864 [2019-12-27 06:40:51,545 INFO L226 Difference]: Without dead ends: 7408 [2019-12-27 06:40:51,547 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 06:40:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-27 06:40:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-27 06:40:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-27 06:40:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-27 06:40:52,118 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-27 06:40:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:52,119 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-27 06:40:52,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:40:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-27 06:40:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:40:52,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:52,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:40:52,123 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-27 06:40:52,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:52,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709012004] [2019-12-27 06:40:52,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:52,230 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 06:40:52,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709012004] [2019-12-27 06:40:52,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:52,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:40:52,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309458090] [2019-12-27 06:40:52,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:40:52,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:52,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:40:52,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:40:52,234 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-27 06:40:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:52,767 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-27 06:40:52,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:40:52,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:40:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:52,885 INFO L225 Difference]: With dead ends: 11318 [2019-12-27 06:40:52,885 INFO L226 Difference]: Without dead ends: 11311 [2019-12-27 06:40:52,888 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 06:40:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-27 06:40:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-27 06:40:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-27 06:40:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-27 06:40:53,424 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-27 06:40:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:53,425 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-27 06:40:53,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:40:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-27 06:40:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:40:53,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:53,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:40:53,436 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:53,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-27 06:40:53,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:53,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279940490] [2019-12-27 06:40:53,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:53,590 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 06:40:53,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279940490] [2019-12-27 06:40:53,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:53,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:40:53,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874488663] [2019-12-27 06:40:53,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:40:53,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:53,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:40:53,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:40:53,594 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-27 06:40:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:53,939 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-27 06:40:53,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:40:53,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 06:40:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:53,989 INFO L225 Difference]: With dead ends: 14191 [2019-12-27 06:40:53,990 INFO L226 Difference]: Without dead ends: 14191 [2019-12-27 06:40:53,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:40:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-27 06:40:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-27 06:40:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-27 06:40:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-27 06:40:54,995 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-27 06:40:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:54,997 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-27 06:40:54,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:40:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-27 06:40:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:40:55,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:55,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:40:55,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:55,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:55,001 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-27 06:40:55,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:55,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766217696] [2019-12-27 06:40:55,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:55,124 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 06:40:55,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766217696] [2019-12-27 06:40:55,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:55,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:40:55,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926690724] [2019-12-27 06:40:55,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:40:55,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:55,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:40:55,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:40:55,127 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 4 states. [2019-12-27 06:40:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:55,176 INFO L93 Difference]: Finished difference Result 2163 states and 5380 transitions. [2019-12-27 06:40:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:40:55,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:40:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:55,184 INFO L225 Difference]: With dead ends: 2163 [2019-12-27 06:40:55,184 INFO L226 Difference]: Without dead ends: 1539 [2019-12-27 06:40:55,185 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 06:40:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-12-27 06:40:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1523. [2019-12-27 06:40:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-27 06:40:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3383 transitions. [2019-12-27 06:40:55,214 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3383 transitions. Word has length 16 [2019-12-27 06:40:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:55,215 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3383 transitions. [2019-12-27 06:40:55,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:40:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3383 transitions. [2019-12-27 06:40:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:40:55,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:55,218 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 06:40:55,218 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:55,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-27 06:40:55,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:55,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871592147] [2019-12-27 06:40:55,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:55,357 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 06:40:55,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871592147] [2019-12-27 06:40:55,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:55,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:40:55,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46062718] [2019-12-27 06:40:55,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:40:55,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:55,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:40:55,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:40:55,359 INFO L87 Difference]: Start difference. First operand 1523 states and 3383 transitions. Second operand 6 states. [2019-12-27 06:40:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:55,769 INFO L93 Difference]: Finished difference Result 2313 states and 4927 transitions. [2019-12-27 06:40:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:40:55,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 06:40:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:55,779 INFO L225 Difference]: With dead ends: 2313 [2019-12-27 06:40:55,779 INFO L226 Difference]: Without dead ends: 2260 [2019-12-27 06:40:55,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:40:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-27 06:40:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1600. [2019-12-27 06:40:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-27 06:40:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3528 transitions. [2019-12-27 06:40:55,814 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3528 transitions. Word has length 25 [2019-12-27 06:40:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:55,814 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3528 transitions. [2019-12-27 06:40:55,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:40:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3528 transitions. [2019-12-27 06:40:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:40:55,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:55,817 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] [2019-12-27 06:40:55,817 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 607421545, now seen corresponding path program 1 times [2019-12-27 06:40:55,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:55,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531190433] [2019-12-27 06:40:55,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:55,917 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 06:40:55,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531190433] [2019-12-27 06:40:55,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:55,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:40:55,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096390412] [2019-12-27 06:40:55,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:40:55,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:55,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:40:55,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:40:55,920 INFO L87 Difference]: Start difference. First operand 1600 states and 3528 transitions. Second operand 5 states. [2019-12-27 06:40:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:56,456 INFO L93 Difference]: Finished difference Result 2343 states and 5072 transitions. [2019-12-27 06:40:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:40:56,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:40:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:56,462 INFO L225 Difference]: With dead ends: 2343 [2019-12-27 06:40:56,463 INFO L226 Difference]: Without dead ends: 2343 [2019-12-27 06:40:56,463 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 06:40:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-12-27 06:40:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2045. [2019-12-27 06:40:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-27 06:40:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4487 transitions. [2019-12-27 06:40:56,501 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4487 transitions. Word has length 26 [2019-12-27 06:40:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:56,501 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4487 transitions. [2019-12-27 06:40:56,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:40:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4487 transitions. [2019-12-27 06:40:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:40:56,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:56,504 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] [2019-12-27 06:40:56,505 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:56,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-27 06:40:56,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:56,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536843958] [2019-12-27 06:40:56,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:56,600 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 06:40:56,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536843958] [2019-12-27 06:40:56,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:56,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:40:56,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933507807] [2019-12-27 06:40:56,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:40:56,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:56,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:40:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:40:56,602 INFO L87 Difference]: Start difference. First operand 2045 states and 4487 transitions. Second operand 5 states. [2019-12-27 06:40:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:56,648 INFO L93 Difference]: Finished difference Result 1263 states and 2646 transitions. [2019-12-27 06:40:56,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:40:56,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 06:40:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:56,651 INFO L225 Difference]: With dead ends: 1263 [2019-12-27 06:40:56,651 INFO L226 Difference]: Without dead ends: 1144 [2019-12-27 06:40:56,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:40:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-27 06:40:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1055. [2019-12-27 06:40:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-27 06:40:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2231 transitions. [2019-12-27 06:40:56,671 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2231 transitions. Word has length 27 [2019-12-27 06:40:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:56,672 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 2231 transitions. [2019-12-27 06:40:56,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:40:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2231 transitions. [2019-12-27 06:40:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:40:56,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:56,680 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] [2019-12-27 06:40:56,680 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:56,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1622987432, now seen corresponding path program 1 times [2019-12-27 06:40:56,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:56,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544028069] [2019-12-27 06:40:56,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:56,836 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 06:40:56,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544028069] [2019-12-27 06:40:56,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:56,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:40:56,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839772272] [2019-12-27 06:40:56,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:40:56,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:40:56,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:40:56,838 INFO L87 Difference]: Start difference. First operand 1055 states and 2231 transitions. Second operand 7 states. [2019-12-27 06:40:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:57,128 INFO L93 Difference]: Finished difference Result 3013 states and 6181 transitions. [2019-12-27 06:40:57,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:40:57,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 06:40:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:57,131 INFO L225 Difference]: With dead ends: 3013 [2019-12-27 06:40:57,132 INFO L226 Difference]: Without dead ends: 2064 [2019-12-27 06:40:57,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:40:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-27 06:40:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1102. [2019-12-27 06:40:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-27 06:40:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2323 transitions. [2019-12-27 06:40:57,157 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2323 transitions. Word has length 51 [2019-12-27 06:40:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:57,157 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2323 transitions. [2019-12-27 06:40:57,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:40:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2323 transitions. [2019-12-27 06:40:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:40:57,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:57,160 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] [2019-12-27 06:40:57,160 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:57,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2012209130, now seen corresponding path program 2 times [2019-12-27 06:40:57,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:57,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589228424] [2019-12-27 06:40:57,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:57,226 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 06:40:57,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589228424] [2019-12-27 06:40:57,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:57,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:40:57,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685385502] [2019-12-27 06:40:57,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:40:57,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:40:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:40:57,229 INFO L87 Difference]: Start difference. First operand 1102 states and 2323 transitions. Second operand 4 states. [2019-12-27 06:40:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:57,246 INFO L93 Difference]: Finished difference Result 1851 states and 3924 transitions. [2019-12-27 06:40:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:40:57,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 06:40:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:57,248 INFO L225 Difference]: With dead ends: 1851 [2019-12-27 06:40:57,248 INFO L226 Difference]: Without dead ends: 818 [2019-12-27 06:40:57,249 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 06:40:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-27 06:40:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2019-12-27 06:40:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-12-27 06:40:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1731 transitions. [2019-12-27 06:40:57,261 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1731 transitions. Word has length 51 [2019-12-27 06:40:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:57,262 INFO L462 AbstractCegarLoop]: Abstraction has 818 states and 1731 transitions. [2019-12-27 06:40:57,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:40:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1731 transitions. [2019-12-27 06:40:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:40:57,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:57,264 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] [2019-12-27 06:40:57,265 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash -391470674, now seen corresponding path program 3 times [2019-12-27 06:40:57,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:57,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136978666] [2019-12-27 06:40:57,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:57,360 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 06:40:57,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136978666] [2019-12-27 06:40:57,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:57,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:40:57,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943766950] [2019-12-27 06:40:57,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:40:57,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:40:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:40:57,363 INFO L87 Difference]: Start difference. First operand 818 states and 1731 transitions. Second operand 7 states. [2019-12-27 06:40:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:57,605 INFO L93 Difference]: Finished difference Result 1396 states and 2860 transitions. [2019-12-27 06:40:57,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:40:57,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 06:40:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:57,608 INFO L225 Difference]: With dead ends: 1396 [2019-12-27 06:40:57,608 INFO L226 Difference]: Without dead ends: 948 [2019-12-27 06:40:57,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:40:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-27 06:40:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 794. [2019-12-27 06:40:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-12-27 06:40:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1681 transitions. [2019-12-27 06:40:57,622 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1681 transitions. Word has length 51 [2019-12-27 06:40:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:57,623 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1681 transitions. [2019-12-27 06:40:57,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:40:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1681 transitions. [2019-12-27 06:40:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:40:57,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:57,625 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] [2019-12-27 06:40:57,626 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash -167213104, now seen corresponding path program 4 times [2019-12-27 06:40:57,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:57,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653443803] [2019-12-27 06:40:57,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:57,689 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 06:40:57,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653443803] [2019-12-27 06:40:57,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:57,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:40:57,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335107846] [2019-12-27 06:40:57,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:40:57,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:57,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:40:57,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:40:57,691 INFO L87 Difference]: Start difference. First operand 794 states and 1681 transitions. Second operand 3 states. [2019-12-27 06:40:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:57,739 INFO L93 Difference]: Finished difference Result 1036 states and 2174 transitions. [2019-12-27 06:40:57,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:40:57,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 06:40:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:57,741 INFO L225 Difference]: With dead ends: 1036 [2019-12-27 06:40:57,741 INFO L226 Difference]: Without dead ends: 1036 [2019-12-27 06:40:57,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 06:40:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-12-27 06:40:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 840. [2019-12-27 06:40:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-27 06:40:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1784 transitions. [2019-12-27 06:40:57,756 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1784 transitions. Word has length 51 [2019-12-27 06:40:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:57,756 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1784 transitions. [2019-12-27 06:40:57,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:40:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1784 transitions. [2019-12-27 06:40:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:40:57,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:57,759 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] [2019-12-27 06:40:57,759 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1521738657, now seen corresponding path program 1 times [2019-12-27 06:40:57,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:57,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82252680] [2019-12-27 06:40:57,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:57,852 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 06:40:57,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82252680] [2019-12-27 06:40:57,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:57,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:40:57,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093633009] [2019-12-27 06:40:57,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:40:57,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:40:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:40:57,855 INFO L87 Difference]: Start difference. First operand 840 states and 1784 transitions. Second operand 6 states. [2019-12-27 06:40:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:58,304 INFO L93 Difference]: Finished difference Result 993 states and 2070 transitions. [2019-12-27 06:40:58,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:40:58,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 06:40:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:58,307 INFO L225 Difference]: With dead ends: 993 [2019-12-27 06:40:58,307 INFO L226 Difference]: Without dead ends: 993 [2019-12-27 06:40:58,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:40:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-12-27 06:40:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 900. [2019-12-27 06:40:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-27 06:40:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1900 transitions. [2019-12-27 06:40:58,323 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1900 transitions. Word has length 52 [2019-12-27 06:40:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:58,323 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1900 transitions. [2019-12-27 06:40:58,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:40:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1900 transitions. [2019-12-27 06:40:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:40:58,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:58,326 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] [2019-12-27 06:40:58,326 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:58,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:58,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1375799289, now seen corresponding path program 2 times [2019-12-27 06:40:58,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:58,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512453053] [2019-12-27 06:40:58,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:40:58,403 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 06:40:58,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512453053] [2019-12-27 06:40:58,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:40:58,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:40:58,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286916431] [2019-12-27 06:40:58,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:40:58,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:40:58,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:40:58,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:40:58,405 INFO L87 Difference]: Start difference. First operand 900 states and 1900 transitions. Second operand 3 states. [2019-12-27 06:40:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:40:58,418 INFO L93 Difference]: Finished difference Result 899 states and 1898 transitions. [2019-12-27 06:40:58,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:40:58,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:40:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:40:58,420 INFO L225 Difference]: With dead ends: 899 [2019-12-27 06:40:58,420 INFO L226 Difference]: Without dead ends: 899 [2019-12-27 06:40:58,420 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 06:40:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-27 06:40:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 743. [2019-12-27 06:40:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-27 06:40:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1605 transitions. [2019-12-27 06:40:58,433 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1605 transitions. Word has length 52 [2019-12-27 06:40:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:40:58,434 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1605 transitions. [2019-12-27 06:40:58,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:40:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1605 transitions. [2019-12-27 06:40:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:40:58,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:40:58,436 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] [2019-12-27 06:40:58,436 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:40:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:40:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-27 06:40:58,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:40:58,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461394710] [2019-12-27 06:40:58,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:40:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:40:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:40:58,546 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:40:58,547 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:40:58,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1281~0.base_24|)) (= |v_ULTIMATE.start_main_~#t1281~0.offset_19| 0) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1281~0.base_24| 1)) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1281~0.base_24| 4)) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1281~0.base_24|) (= v_~y$w_buff0_used~0_106 0) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_16) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1281~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1281~0.base_24|) |v_ULTIMATE.start_main_~#t1281~0.offset_19| 0)) |v_#memory_int_17|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ULTIMATE.start_main_~#t1282~0.offset=|v_ULTIMATE.start_main_~#t1282~0.offset_19|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1281~0.base=|v_ULTIMATE.start_main_~#t1281~0.base_24|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1281~0.offset=|v_ULTIMATE.start_main_~#t1281~0.offset_19|, ULTIMATE.start_main_~#t1282~0.base=|v_ULTIMATE.start_main_~#t1282~0.base_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1282~0.offset, ~y~0, ULTIMATE.start_main_~#t1281~0.base, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1281~0.offset, ULTIMATE.start_main_~#t1282~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:40:58,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1282~0.base_13| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t1282~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1282~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1282~0.base_13|) |v_ULTIMATE.start_main_~#t1282~0.offset_11| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1282~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1282~0.offset_11| 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1282~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1282~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1282~0.base=|v_ULTIMATE.start_main_~#t1282~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1282~0.offset=|v_ULTIMATE.start_main_~#t1282~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1282~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1282~0.offset] because there is no mapped edge [2019-12-27 06:40:58,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= ~y$r_buff1_thd0~0_Out-573459208 ~y$r_buff0_thd0~0_In-573459208) (= ~y$r_buff1_thd2~0_Out-573459208 ~y$r_buff0_thd2~0_In-573459208) (= ~y$r_buff0_thd1~0_In-573459208 ~y$r_buff1_thd1~0_Out-573459208) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-573459208 0)) (= ~x~0_In-573459208 ~__unbuffered_p0_EAX~0_Out-573459208) (= ~y$r_buff0_thd1~0_Out-573459208 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-573459208, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-573459208, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-573459208, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-573459208, ~x~0=~x~0_In-573459208} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-573459208, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-573459208, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-573459208, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-573459208, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-573459208, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-573459208, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-573459208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-573459208, ~x~0=~x~0_In-573459208} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:40:58,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In876712897 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In876712897 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out876712897|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In876712897 |P0Thread1of1ForFork0_#t~ite5_Out876712897|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In876712897, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In876712897} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out876712897|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In876712897, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In876712897} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:40:58,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1805556397 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1805556397 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1805556397 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1805556397 256) 0)) (= (mod ~y$w_buff0_used~0_In-1805556397 256) 0))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1805556397| ~y$w_buff0_used~0_In-1805556397) (= |P1Thread1of1ForFork1_#t~ite20_Out-1805556397| |P1Thread1of1ForFork1_#t~ite21_Out-1805556397|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1805556397| |P1Thread1of1ForFork1_#t~ite20_Out-1805556397|) (= ~y$w_buff0_used~0_In-1805556397 |P1Thread1of1ForFork1_#t~ite21_Out-1805556397|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1805556397, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805556397, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1805556397|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1805556397, ~weak$$choice2~0=~weak$$choice2~0_In-1805556397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1805556397} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1805556397, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805556397, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1805556397|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1805556397, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1805556397|, ~weak$$choice2~0=~weak$$choice2~0_In-1805556397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1805556397} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 06:40:58,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse4 (= (mod ~y$r_buff1_thd2~0_In-1201486149 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-1201486149| |P1Thread1of1ForFork1_#t~ite23_Out-1201486149|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In-1201486149 256))) (.cse5 (= (mod ~y$w_buff0_used~0_In-1201486149 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1201486149 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1201486149 256) 0))) (or (and (or (and .cse0 .cse1 (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out-1201486149| ~y$w_buff1_used~0_In-1201486149)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out-1201486149| ~y$w_buff1_used~0_In-1201486149) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_Out-1201486149| |P1Thread1of1ForFork1_#t~ite23_In-1201486149|))) (= |P1Thread1of1ForFork1_#t~ite22_In-1201486149| |P1Thread1of1ForFork1_#t~ite22_Out-1201486149|)) (let ((.cse6 (not .cse2))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-1201486149| 0) (or .cse6 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1201486149| |P1Thread1of1ForFork1_#t~ite22_Out-1201486149|) .cse0 .cse1 (not .cse5) (or .cse6 (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1201486149, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1201486149, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1201486149, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1201486149|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1201486149|, ~weak$$choice2~0=~weak$$choice2~0_In-1201486149, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1201486149} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1201486149, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1201486149, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1201486149, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1201486149|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1201486149|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1201486149|, ~weak$$choice2~0=~weak$$choice2~0_In-1201486149, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1201486149} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 06:40:58,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 06:40:58,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In181527277 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In181527277 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In181527277 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In181527277 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out181527277|)) (and (= ~y$w_buff1_used~0_In181527277 |P0Thread1of1ForFork0_#t~ite6_Out181527277|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In181527277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In181527277, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In181527277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In181527277} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out181527277|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In181527277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In181527277, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In181527277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In181527277} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:40:58,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1672643886 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1672643886 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out1672643886 ~y$r_buff0_thd1~0_In1672643886) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd1~0_Out1672643886 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1672643886, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1672643886} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1672643886, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1672643886|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1672643886} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:40:58,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1348323971| |P1Thread1of1ForFork1_#t~ite29_Out1348323971|)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In1348323971 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1348323971 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In1348323971 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1348323971 256))) (.cse5 (= (mod ~weak$$choice2~0_In1348323971 256) 0))) (or (let ((.cse2 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1348323971| |P1Thread1of1ForFork1_#t~ite28_Out1348323971|) .cse0 (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1348323971|) (or .cse2 (not .cse3)) (or .cse2 (not .cse4)) .cse5)) (and (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out1348323971| ~y$r_buff1_thd2~0_In1348323971) (or (and .cse4 .cse6) (and .cse3 .cse6) .cse1) .cse5) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1348323971| |P1Thread1of1ForFork1_#t~ite29_In1348323971|) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite30_Out1348323971| ~y$r_buff1_thd2~0_In1348323971))) (= |P1Thread1of1ForFork1_#t~ite28_In1348323971| |P1Thread1of1ForFork1_#t~ite28_Out1348323971|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1348323971, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1348323971|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1348323971, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1348323971, ~weak$$choice2~0=~weak$$choice2~0_In1348323971, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1348323971|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1348323971} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1348323971, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1348323971|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1348323971|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1348323971, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1348323971, ~weak$$choice2~0=~weak$$choice2~0_In1348323971, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1348323971|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1348323971} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 06:40:58,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1398158772 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1398158772 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1398158772 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1398158772 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1398158772|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-1398158772 |P0Thread1of1ForFork0_#t~ite8_Out-1398158772|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1398158772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398158772, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1398158772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398158772} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1398158772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398158772, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1398158772|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1398158772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398158772} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:40:58,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 06:40:58,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1183453860 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1183453860 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-1183453860 |P1Thread1of1ForFork1_#t~ite32_Out-1183453860|)) (and (= ~y$w_buff1~0_In-1183453860 |P1Thread1of1ForFork1_#t~ite32_Out-1183453860|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1183453860, ~y$w_buff1~0=~y$w_buff1~0_In-1183453860, ~y~0=~y~0_In-1183453860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1183453860} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1183453860, ~y$w_buff1~0=~y$w_buff1~0_In-1183453860, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1183453860|, ~y~0=~y~0_In-1183453860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1183453860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 06:40:58,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 06:40:58,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In782869223 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In782869223 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out782869223|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In782869223 |P1Thread1of1ForFork1_#t~ite34_Out782869223|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In782869223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In782869223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In782869223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In782869223, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out782869223|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 06:40:58,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1053523061 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1053523061 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1053523061 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1053523061 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1053523061|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1053523061 |P1Thread1of1ForFork1_#t~ite35_Out-1053523061|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1053523061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1053523061, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1053523061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1053523061} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1053523061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1053523061, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1053523061, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1053523061|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1053523061} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 06:40:58,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1085999636 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1085999636 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1085999636| ~y$r_buff0_thd2~0_In-1085999636)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1085999636| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1085999636, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1085999636} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1085999636, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1085999636, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1085999636|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 06:40:58,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1086671793 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1086671793 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1086671793 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1086671793 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1086671793| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out1086671793| ~y$r_buff1_thd2~0_In1086671793) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1086671793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1086671793, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1086671793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1086671793} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1086671793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1086671793, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1086671793, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1086671793|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1086671793} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:40:58,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:40:58,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:40:58,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:40:58,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1916213607 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1916213607 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1916213607| ~y$w_buff1~0_In-1916213607) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1916213607| ~y~0_In-1916213607)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1916213607, ~y~0=~y~0_In-1916213607, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1916213607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1916213607} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1916213607|, ~y$w_buff1~0=~y$w_buff1~0_In-1916213607, ~y~0=~y~0_In-1916213607, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1916213607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1916213607} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:40:58,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 06:40:58,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1017875709 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1017875709 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1017875709 |ULTIMATE.start_main_#t~ite42_Out-1017875709|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1017875709|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1017875709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1017875709} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1017875709, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1017875709, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1017875709|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:40:58,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-2122284392 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2122284392 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2122284392 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2122284392 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-2122284392|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-2122284392 |ULTIMATE.start_main_#t~ite43_Out-2122284392|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2122284392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2122284392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2122284392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2122284392} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2122284392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2122284392, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2122284392|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2122284392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2122284392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:40:58,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In26835046 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In26835046 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out26835046| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out26835046| ~y$r_buff0_thd0~0_In26835046)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In26835046, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26835046} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In26835046, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26835046, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out26835046|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:40:58,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In458136706 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In458136706 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In458136706 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In458136706 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out458136706| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out458136706| ~y$r_buff1_thd0~0_In458136706) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In458136706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In458136706, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In458136706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In458136706} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In458136706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In458136706, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In458136706, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out458136706|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In458136706} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:40:58,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EAX~0_8) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:40:58,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:40:58 BasicIcfg [2019-12-27 06:40:58,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:40:58,661 INFO L168 Benchmark]: Toolchain (without parser) took 13872.20 ms. Allocated memory was 138.4 MB in the beginning and 567.8 MB in the end (delta: 429.4 MB). Free memory was 101.6 MB in the beginning and 240.6 MB in the end (delta: -139.0 MB). Peak memory consumption was 290.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:40:58,662 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:40:58,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.91 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 101.2 MB in the beginning and 156.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:40:58,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.10 ms. Allocated memory is still 203.9 MB. Free memory was 156.5 MB in the beginning and 153.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 06:40:58,664 INFO L168 Benchmark]: Boogie Preprocessor took 40.33 ms. Allocated memory is still 203.9 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:40:58,665 INFO L168 Benchmark]: RCFGBuilder took 868.29 ms. Allocated memory is still 203.9 MB. Free memory was 151.6 MB in the beginning and 107.1 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:40:58,666 INFO L168 Benchmark]: TraceAbstraction took 12130.99 ms. Allocated memory was 203.9 MB in the beginning and 567.8 MB in the end (delta: 363.9 MB). Free memory was 107.1 MB in the beginning and 240.6 MB in the end (delta: -133.5 MB). Peak memory consumption was 230.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:40:58,674 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.91 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 101.2 MB in the beginning and 156.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.10 ms. Allocated memory is still 203.9 MB. Free memory was 156.5 MB in the beginning and 153.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 40.33 ms. Allocated memory is still 203.9 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 868.29 ms. Allocated memory is still 203.9 MB. Free memory was 151.6 MB in the beginning and 107.1 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12130.99 ms. Allocated memory was 203.9 MB in the beginning and 567.8 MB in the end (delta: 363.9 MB). Free memory was 107.1 MB in the beginning and 240.6 MB in the end (delta: -133.5 MB). Peak memory consumption was 230.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1676 SDtfs, 1855 SDslu, 3506 SDs, 0 SdLazy, 1852 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred 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: 2.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 6943 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 50459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...