/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/rfi007_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:07:32,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:07:32,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:07:32,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:07:32,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:07:32,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:07:32,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:07:32,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:07:32,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:07:32,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:07:32,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:07:32,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:07:32,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:07:32,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:07:32,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:07:32,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:07:32,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:07:32,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:07:32,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:07:32,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:07:32,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:07:32,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:07:32,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:07:32,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:07:32,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:07:32,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:07:32,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:07:32,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:07:32,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:07:32,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:07:32,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:07:32,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:07:32,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:07:32,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:07:32,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:07:32,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:07:32,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:07:32,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:07:32,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:07:32,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:07:32,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:07:32,496 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-18 22:07:32,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:07:32,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:07:32,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:07:32,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:07:32,512 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:07:32,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:07:32,512 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:07:32,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:07:32,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:07:32,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:07:32,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:07:32,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:07:32,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:07:32,514 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:07:32,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:07:32,514 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:07:32,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:07:32,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:07:32,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:07:32,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:07:32,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:07:32,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:07:32,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:07:32,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:07:32,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:07:32,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:07:32,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:07:32,517 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:07:32,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:07:32,517 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:07:32,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:07:32,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:07:32,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:07:32,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:07:32,839 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:07:32,840 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-18 22:07:32,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be605eb5f/7e1f8a72b9484b7d904cfb51ce8ee729/FLAGc7a491921 [2019-12-18 22:07:33,460 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:07:33,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-18 22:07:33,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be605eb5f/7e1f8a72b9484b7d904cfb51ce8ee729/FLAGc7a491921 [2019-12-18 22:07:33,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be605eb5f/7e1f8a72b9484b7d904cfb51ce8ee729 [2019-12-18 22:07:33,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:07:33,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:07:33,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:07:33,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:07:33,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:07:33,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:07:33" (1/1) ... [2019-12-18 22:07:33,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32100126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:33, skipping insertion in model container [2019-12-18 22:07:33,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:07:33" (1/1) ... [2019-12-18 22:07:33,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:07:33,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:07:34,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:07:34,365 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:07:34,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:07:34,506 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:07:34,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34 WrapperNode [2019-12-18 22:07:34,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:07:34,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:07:34,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:07:34,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:07:34,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (1/1) ... [2019-12-18 22:07:34,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (1/1) ... [2019-12-18 22:07:34,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:07:34,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:07:34,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:07:34,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:07:34,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (1/1) ... [2019-12-18 22:07:34,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (1/1) ... [2019-12-18 22:07:34,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (1/1) ... [2019-12-18 22:07:34,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (1/1) ... [2019-12-18 22:07:34,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (1/1) ... [2019-12-18 22:07:34,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (1/1) ... [2019-12-18 22:07:34,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (1/1) ... [2019-12-18 22:07:34,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:07:34,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:07:34,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:07:34,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:07:34,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (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-18 22:07:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:07:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:07:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:07:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:07:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:07:34,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:07:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:07:34,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:07:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:07:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:07:34,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:07:34,680 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:07:35,399 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:07:35,399 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:07:35,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:07:35 BoogieIcfgContainer [2019-12-18 22:07:35,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:07:35,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:07:35,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:07:35,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:07:35,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:07:33" (1/3) ... [2019-12-18 22:07:35,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbb9c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:07:35, skipping insertion in model container [2019-12-18 22:07:35,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:07:34" (2/3) ... [2019-12-18 22:07:35,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbb9c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:07:35, skipping insertion in model container [2019-12-18 22:07:35,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:07:35" (3/3) ... [2019-12-18 22:07:35,410 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc.i [2019-12-18 22:07:35,420 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:07:35,421 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:07:35,429 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:07:35,430 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:07:35,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,469 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,470 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,470 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,471 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,471 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,481 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,481 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,536 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,539 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:07:35,555 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:07:35,575 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:07:35,576 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:07:35,576 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:07:35,576 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:07:35,576 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:07:35,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:07:35,576 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:07:35,576 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:07:35,598 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 22:07:35,600 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 22:07:35,679 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 22:07:35,679 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:07:35,695 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 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 22:07:35,717 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 22:07:35,766 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 22:07:35,767 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:07:35,775 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 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 22:07:35,791 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 22:07:35,792 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:07:38,884 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 22:07:38,991 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 22:07:39,082 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-18 22:07:39,082 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-18 22:07:39,086 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 90 transitions [2019-12-18 22:07:39,708 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9707 states. [2019-12-18 22:07:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states. [2019-12-18 22:07:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:07:39,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:39,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:07:39,724 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:39,731 INFO L82 PathProgramCache]: Analyzing trace with hash 787412, now seen corresponding path program 1 times [2019-12-18 22:07:39,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:39,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226799693] [2019-12-18 22:07:39,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:39,976 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-18 22:07:39,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226799693] [2019-12-18 22:07:39,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:39,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:07:39,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658819868] [2019-12-18 22:07:39,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:07:39,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:40,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:07:40,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:07:40,004 INFO L87 Difference]: Start difference. First operand 9707 states. Second operand 3 states. [2019-12-18 22:07:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:40,337 INFO L93 Difference]: Finished difference Result 9421 states and 30351 transitions. [2019-12-18 22:07:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:07:40,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:07:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:40,447 INFO L225 Difference]: With dead ends: 9421 [2019-12-18 22:07:40,447 INFO L226 Difference]: Without dead ends: 8862 [2019-12-18 22:07:40,449 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-18 22:07:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2019-12-18 22:07:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8862. [2019-12-18 22:07:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8862 states. [2019-12-18 22:07:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 28501 transitions. [2019-12-18 22:07:41,003 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 28501 transitions. Word has length 3 [2019-12-18 22:07:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:41,003 INFO L462 AbstractCegarLoop]: Abstraction has 8862 states and 28501 transitions. [2019-12-18 22:07:41,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:07:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 28501 transitions. [2019-12-18 22:07:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:07:41,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:41,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:07:41,009 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1755658876, now seen corresponding path program 1 times [2019-12-18 22:07:41,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:41,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273667973] [2019-12-18 22:07:41,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:41,118 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-18 22:07:41,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273667973] [2019-12-18 22:07:41,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:41,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:07:41,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339606602] [2019-12-18 22:07:41,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:07:41,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:41,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:07:41,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:07:41,122 INFO L87 Difference]: Start difference. First operand 8862 states and 28501 transitions. Second operand 4 states. [2019-12-18 22:07:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:41,633 INFO L93 Difference]: Finished difference Result 13396 states and 41079 transitions. [2019-12-18 22:07:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:07:41,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:07:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:41,722 INFO L225 Difference]: With dead ends: 13396 [2019-12-18 22:07:41,722 INFO L226 Difference]: Without dead ends: 13389 [2019-12-18 22:07:41,723 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-18 22:07:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2019-12-18 22:07:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 12015. [2019-12-18 22:07:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-18 22:07:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 37536 transitions. [2019-12-18 22:07:42,865 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 37536 transitions. Word has length 11 [2019-12-18 22:07:42,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:42,866 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 37536 transitions. [2019-12-18 22:07:42,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:07:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 37536 transitions. [2019-12-18 22:07:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:07:42,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:42,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:07:42,871 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:42,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1550555126, now seen corresponding path program 1 times [2019-12-18 22:07:42,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:42,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411574019] [2019-12-18 22:07:42,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:42,998 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-18 22:07:42,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411574019] [2019-12-18 22:07:42,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:42,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:07:42,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705492505] [2019-12-18 22:07:43,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:07:43,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:43,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:07:43,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:07:43,002 INFO L87 Difference]: Start difference. First operand 12015 states and 37536 transitions. Second operand 4 states. [2019-12-18 22:07:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:43,244 INFO L93 Difference]: Finished difference Result 14164 states and 44146 transitions. [2019-12-18 22:07:43,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:07:43,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:07:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:43,296 INFO L225 Difference]: With dead ends: 14164 [2019-12-18 22:07:43,296 INFO L226 Difference]: Without dead ends: 14164 [2019-12-18 22:07:43,296 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-18 22:07:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14164 states. [2019-12-18 22:07:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14164 to 12676. [2019-12-18 22:07:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12676 states. [2019-12-18 22:07:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 39720 transitions. [2019-12-18 22:07:43,860 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 39720 transitions. Word has length 14 [2019-12-18 22:07:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:43,865 INFO L462 AbstractCegarLoop]: Abstraction has 12676 states and 39720 transitions. [2019-12-18 22:07:43,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:07:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 39720 transitions. [2019-12-18 22:07:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 22:07:43,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:43,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:07:43,871 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:43,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:43,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1838903681, now seen corresponding path program 1 times [2019-12-18 22:07:43,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:43,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268796550] [2019-12-18 22:07:43,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:43,965 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-18 22:07:43,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268796550] [2019-12-18 22:07:43,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:43,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:07:43,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929640213] [2019-12-18 22:07:43,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:07:43,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:43,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:07:43,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:07:43,969 INFO L87 Difference]: Start difference. First operand 12676 states and 39720 transitions. Second operand 3 states. [2019-12-18 22:07:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:44,036 INFO L93 Difference]: Finished difference Result 12673 states and 39711 transitions. [2019-12-18 22:07:44,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:07:44,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 22:07:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:44,081 INFO L225 Difference]: With dead ends: 12673 [2019-12-18 22:07:44,081 INFO L226 Difference]: Without dead ends: 12673 [2019-12-18 22:07:44,082 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-18 22:07:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-18 22:07:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 12673. [2019-12-18 22:07:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-18 22:07:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 39711 transitions. [2019-12-18 22:07:44,618 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 39711 transitions. Word has length 16 [2019-12-18 22:07:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:44,619 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 39711 transitions. [2019-12-18 22:07:44,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:07:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 39711 transitions. [2019-12-18 22:07:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:07:44,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:44,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:07:44,624 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash -601685409, now seen corresponding path program 1 times [2019-12-18 22:07:44,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:44,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904633202] [2019-12-18 22:07:44,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:44,663 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-18 22:07:44,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904633202] [2019-12-18 22:07:44,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:44,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:07:44,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006666052] [2019-12-18 22:07:44,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:07:44,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:07:44,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:07:44,666 INFO L87 Difference]: Start difference. First operand 12673 states and 39711 transitions. Second operand 3 states. [2019-12-18 22:07:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:44,771 INFO L93 Difference]: Finished difference Result 21543 states and 67050 transitions. [2019-12-18 22:07:44,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:07:44,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 22:07:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:44,816 INFO L225 Difference]: With dead ends: 21543 [2019-12-18 22:07:44,816 INFO L226 Difference]: Without dead ends: 12171 [2019-12-18 22:07:44,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:07:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-18 22:07:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 11475. [2019-12-18 22:07:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-18 22:07:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 34983 transitions. [2019-12-18 22:07:45,160 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 34983 transitions. Word has length 17 [2019-12-18 22:07:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:45,161 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 34983 transitions. [2019-12-18 22:07:45,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:07:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 34983 transitions. [2019-12-18 22:07:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:07:45,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:45,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:07:45,173 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:45,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1176802527, now seen corresponding path program 1 times [2019-12-18 22:07:45,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:45,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537842656] [2019-12-18 22:07:45,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:45,222 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-18 22:07:45,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537842656] [2019-12-18 22:07:45,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:45,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:07:45,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153318153] [2019-12-18 22:07:45,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:07:45,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:07:45,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:07:45,225 INFO L87 Difference]: Start difference. First operand 11475 states and 34983 transitions. Second operand 3 states. [2019-12-18 22:07:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:45,450 INFO L93 Difference]: Finished difference Result 10927 states and 32734 transitions. [2019-12-18 22:07:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:07:45,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 22:07:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:45,483 INFO L225 Difference]: With dead ends: 10927 [2019-12-18 22:07:45,483 INFO L226 Difference]: Without dead ends: 10927 [2019-12-18 22:07:45,483 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-18 22:07:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10927 states. [2019-12-18 22:07:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10927 to 10919. [2019-12-18 22:07:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10919 states. [2019-12-18 22:07:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 32718 transitions. [2019-12-18 22:07:45,781 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 32718 transitions. Word has length 17 [2019-12-18 22:07:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:45,781 INFO L462 AbstractCegarLoop]: Abstraction has 10919 states and 32718 transitions. [2019-12-18 22:07:45,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:07:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 32718 transitions. [2019-12-18 22:07:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:07:45,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:45,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:07:45,786 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:45,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1916399741, now seen corresponding path program 1 times [2019-12-18 22:07:45,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:45,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162818312] [2019-12-18 22:07:45,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:45,847 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-18 22:07:45,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162818312] [2019-12-18 22:07:45,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:45,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:07:45,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212051756] [2019-12-18 22:07:45,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:07:45,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:45,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:07:45,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:07:45,849 INFO L87 Difference]: Start difference. First operand 10919 states and 32718 transitions. Second operand 4 states. [2019-12-18 22:07:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:45,881 INFO L93 Difference]: Finished difference Result 1855 states and 4482 transitions. [2019-12-18 22:07:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:07:45,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 22:07:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:45,886 INFO L225 Difference]: With dead ends: 1855 [2019-12-18 22:07:45,886 INFO L226 Difference]: Without dead ends: 1321 [2019-12-18 22:07:45,886 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-18 22:07:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-12-18 22:07:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-12-18 22:07:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-12-18 22:07:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2836 transitions. [2019-12-18 22:07:45,909 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2836 transitions. Word has length 17 [2019-12-18 22:07:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:45,909 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 2836 transitions. [2019-12-18 22:07:45,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:07:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2836 transitions. [2019-12-18 22:07:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:07:45,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:45,911 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-18 22:07:45,911 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:45,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2091906228, now seen corresponding path program 1 times [2019-12-18 22:07:45,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:45,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371227360] [2019-12-18 22:07:45,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:45,997 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-18 22:07:45,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371227360] [2019-12-18 22:07:45,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:45,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:07:45,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938864332] [2019-12-18 22:07:45,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:07:45,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:07:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:07:46,000 INFO L87 Difference]: Start difference. First operand 1321 states and 2836 transitions. Second operand 6 states. [2019-12-18 22:07:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:46,560 INFO L93 Difference]: Finished difference Result 3692 states and 7831 transitions. [2019-12-18 22:07:46,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:07:46,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 22:07:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:46,567 INFO L225 Difference]: With dead ends: 3692 [2019-12-18 22:07:46,568 INFO L226 Difference]: Without dead ends: 3657 [2019-12-18 22:07:46,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:07:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-12-18 22:07:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 1802. [2019-12-18 22:07:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2019-12-18 22:07:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 3967 transitions. [2019-12-18 22:07:46,609 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 3967 transitions. Word has length 25 [2019-12-18 22:07:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:46,609 INFO L462 AbstractCegarLoop]: Abstraction has 1802 states and 3967 transitions. [2019-12-18 22:07:46,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:07:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 3967 transitions. [2019-12-18 22:07:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:07:46,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:46,612 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-18 22:07:46,613 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:46,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1541096581, now seen corresponding path program 1 times [2019-12-18 22:07:46,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:46,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464765113] [2019-12-18 22:07:46,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:46,694 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-18 22:07:46,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464765113] [2019-12-18 22:07:46,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:46,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:07:46,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631447660] [2019-12-18 22:07:46,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:07:46,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:46,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:07:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:07:46,697 INFO L87 Difference]: Start difference. First operand 1802 states and 3967 transitions. Second operand 6 states. [2019-12-18 22:07:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:47,156 INFO L93 Difference]: Finished difference Result 3339 states and 7076 transitions. [2019-12-18 22:07:47,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:07:47,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 22:07:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:47,161 INFO L225 Difference]: With dead ends: 3339 [2019-12-18 22:07:47,162 INFO L226 Difference]: Without dead ends: 3310 [2019-12-18 22:07:47,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:07:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-12-18 22:07:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 1781. [2019-12-18 22:07:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2019-12-18 22:07:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 3928 transitions. [2019-12-18 22:07:47,506 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 3928 transitions. Word has length 26 [2019-12-18 22:07:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:47,506 INFO L462 AbstractCegarLoop]: Abstraction has 1781 states and 3928 transitions. [2019-12-18 22:07:47,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:07:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 3928 transitions. [2019-12-18 22:07:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:07:47,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:47,510 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] [2019-12-18 22:07:47,510 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:47,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1084312717, now seen corresponding path program 1 times [2019-12-18 22:07:47,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:47,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133606526] [2019-12-18 22:07:47,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:47,609 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-18 22:07:47,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133606526] [2019-12-18 22:07:47,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:47,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:07:47,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924013439] [2019-12-18 22:07:47,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:07:47,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:47,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:07:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:07:47,612 INFO L87 Difference]: Start difference. First operand 1781 states and 3928 transitions. Second operand 5 states. [2019-12-18 22:07:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:47,653 INFO L93 Difference]: Finished difference Result 916 states and 1977 transitions. [2019-12-18 22:07:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:07:47,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 22:07:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:47,655 INFO L225 Difference]: With dead ends: 916 [2019-12-18 22:07:47,655 INFO L226 Difference]: Without dead ends: 744 [2019-12-18 22:07:47,656 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-18 22:07:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-12-18 22:07:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-12-18 22:07:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-12-18 22:07:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1655 transitions. [2019-12-18 22:07:47,667 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1655 transitions. Word has length 28 [2019-12-18 22:07:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:47,667 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1655 transitions. [2019-12-18 22:07:47,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:07:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1655 transitions. [2019-12-18 22:07:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 22:07:47,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:47,670 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-18 22:07:47,670 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1928000048, now seen corresponding path program 1 times [2019-12-18 22:07:47,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:47,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798141757] [2019-12-18 22:07:47,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:47,760 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-18 22:07:47,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798141757] [2019-12-18 22:07:47,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:47,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:07:47,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281454777] [2019-12-18 22:07:47,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:07:47,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:07:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:07:47,763 INFO L87 Difference]: Start difference. First operand 744 states and 1655 transitions. Second operand 7 states. [2019-12-18 22:07:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:47,935 INFO L93 Difference]: Finished difference Result 1483 states and 3211 transitions. [2019-12-18 22:07:47,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:07:47,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 22:07:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:47,937 INFO L225 Difference]: With dead ends: 1483 [2019-12-18 22:07:47,938 INFO L226 Difference]: Without dead ends: 990 [2019-12-18 22:07:47,938 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-18 22:07:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-18 22:07:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 819. [2019-12-18 22:07:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-18 22:07:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1780 transitions. [2019-12-18 22:07:47,952 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1780 transitions. Word has length 52 [2019-12-18 22:07:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:47,952 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1780 transitions. [2019-12-18 22:07:47,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:07:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1780 transitions. [2019-12-18 22:07:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 22:07:47,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:47,955 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-18 22:07:47,955 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:47,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1603502286, now seen corresponding path program 2 times [2019-12-18 22:07:47,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:47,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98346243] [2019-12-18 22:07:47,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:48,055 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-18 22:07:48,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98346243] [2019-12-18 22:07:48,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:48,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:07:48,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812256075] [2019-12-18 22:07:48,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:07:48,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:07:48,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:07:48,059 INFO L87 Difference]: Start difference. First operand 819 states and 1780 transitions. Second operand 5 states. [2019-12-18 22:07:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:48,472 INFO L93 Difference]: Finished difference Result 1344 states and 2855 transitions. [2019-12-18 22:07:48,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:07:48,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 22:07:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:48,475 INFO L225 Difference]: With dead ends: 1344 [2019-12-18 22:07:48,475 INFO L226 Difference]: Without dead ends: 1320 [2019-12-18 22:07:48,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-18 22:07:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-12-18 22:07:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1031. [2019-12-18 22:07:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-12-18 22:07:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2242 transitions. [2019-12-18 22:07:48,493 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2242 transitions. Word has length 52 [2019-12-18 22:07:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:48,493 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 2242 transitions. [2019-12-18 22:07:48,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:07:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2242 transitions. [2019-12-18 22:07:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 22:07:48,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:48,497 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-18 22:07:48,497 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:48,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 936201678, now seen corresponding path program 3 times [2019-12-18 22:07:48,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:48,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093435245] [2019-12-18 22:07:48,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:07:48,582 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-18 22:07:48,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093435245] [2019-12-18 22:07:48,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:07:48,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:07:48,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383996804] [2019-12-18 22:07:48,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:07:48,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:07:48,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:07:48,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:07:48,584 INFO L87 Difference]: Start difference. First operand 1031 states and 2242 transitions. Second operand 3 states. [2019-12-18 22:07:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:07:48,652 INFO L93 Difference]: Finished difference Result 1274 states and 2751 transitions. [2019-12-18 22:07:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:07:48,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 22:07:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:07:48,654 INFO L225 Difference]: With dead ends: 1274 [2019-12-18 22:07:48,654 INFO L226 Difference]: Without dead ends: 1274 [2019-12-18 22:07:48,655 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-18 22:07:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-12-18 22:07:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 895. [2019-12-18 22:07:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-18 22:07:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1922 transitions. [2019-12-18 22:07:48,670 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1922 transitions. Word has length 52 [2019-12-18 22:07:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:07:48,670 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1922 transitions. [2019-12-18 22:07:48,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:07:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1922 transitions. [2019-12-18 22:07:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 22:07:48,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:07:48,673 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-18 22:07:48,673 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:07:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:07:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash -616115185, now seen corresponding path program 1 times [2019-12-18 22:07:48,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:07:48,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403914192] [2019-12-18 22:07:48,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:07:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:07:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:07:48,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:07:48,809 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:07:48,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$r_buff0_thd1~0_28) (= 0 v_~x$r_buff0_thd0~0_22) (= 0 v_~x$r_buff0_thd2~0_76) (= v_~x~0_24 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_22|) |v_ULTIMATE.start_main_~#t1705~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x$flush_delayed~0_13 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= 0 v_~x$w_buff0~0_25) (= v_~y~0_15 0) (= 0 |v_ULTIMATE.start_main_~#t1705~0.offset_17|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x$r_buff1_thd2~0_51 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_10 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1705~0.base_22|) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_22| 1)) (= 0 v_~x$w_buff0_used~0_102) (= (select .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_22|) 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~x$r_buff1_thd0~0_19 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1705~0.base_22| 4)) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_16|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, 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_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_13|, ~y~0=v_~y~0_15, ULTIMATE.start_main_~#t1705~0.offset=|v_ULTIMATE.start_main_~#t1705~0.offset_17|, ULTIMATE.start_main_~#t1705~0.base=|v_ULTIMATE.start_main_~#t1705~0.base_22|, ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, 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, ~x~0=v_~x~0_24, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1706~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1705~0.offset, ULTIMATE.start_main_~#t1705~0.base, ULTIMATE.start_main_~#t1706~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:07:48,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_56) (= v_~x$r_buff1_thd1~0_11 v_~x$r_buff0_thd1~0_17) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_14) (= 1 v_~y~0_5) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= 1 v_~x$r_buff0_thd1~0_16)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_11, ~y~0=v_~y~0_5, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:07:48,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1706~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1706~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1706~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12|) |v_ULTIMATE.start_main_~#t1706~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1706~0.offset, ULTIMATE.start_main_~#t1706~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 22:07:48,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In14630735 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In14630735 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out14630735| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out14630735| ~x$w_buff0_used~0_In14630735)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In14630735, ~x$w_buff0_used~0=~x$w_buff0_used~0_In14630735} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out14630735|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In14630735, ~x$w_buff0_used~0=~x$w_buff0_used~0_In14630735} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:07:48,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1650911983 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1650911983| |P1Thread1of1ForFork1_#t~ite15_Out-1650911983|) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out-1650911983| ~x$w_buff0~0_In-1650911983) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1650911983 256)))) (or (= (mod ~x$w_buff0_used~0_In-1650911983 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In-1650911983 256) 0) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-1650911983 256)) .cse1)))) (and (= ~x$w_buff0~0_In-1650911983 |P1Thread1of1ForFork1_#t~ite15_Out-1650911983|) (= |P1Thread1of1ForFork1_#t~ite14_In-1650911983| |P1Thread1of1ForFork1_#t~ite14_Out-1650911983|) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1650911983, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1650911983, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1650911983, ~weak$$choice2~0=~weak$$choice2~0_In-1650911983, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1650911983, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1650911983|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650911983} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1650911983, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1650911983, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1650911983, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1650911983|, ~weak$$choice2~0=~weak$$choice2~0_In-1650911983, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1650911983, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1650911983|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650911983} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:07:48,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1448940963 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-1448940963| |P1Thread1of1ForFork1_#t~ite17_Out-1448940963|) (= |P1Thread1of1ForFork1_#t~ite18_Out-1448940963| ~x$w_buff1~0_In-1448940963) (not .cse0)) (and (= ~x$w_buff1~0_In-1448940963 |P1Thread1of1ForFork1_#t~ite17_Out-1448940963|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1448940963 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-1448940963 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1448940963 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1448940963 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite18_Out-1448940963| |P1Thread1of1ForFork1_#t~ite17_Out-1448940963|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1448940963, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1448940963, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1448940963, ~weak$$choice2~0=~weak$$choice2~0_In-1448940963, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1448940963, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1448940963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1448940963} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1448940963|, ~x$w_buff1~0=~x$w_buff1~0_In-1448940963, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1448940963, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1448940963, ~weak$$choice2~0=~weak$$choice2~0_In-1448940963, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1448940963, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1448940963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1448940963} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 22:07:48,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2063619855 256)))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In2063619855 |P1Thread1of1ForFork1_#t~ite21_Out2063619855|) (= |P1Thread1of1ForFork1_#t~ite20_In2063619855| |P1Thread1of1ForFork1_#t~ite20_Out2063619855|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out2063619855| |P1Thread1of1ForFork1_#t~ite21_Out2063619855|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In2063619855 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In2063619855 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In2063619855 256)) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In2063619855 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out2063619855| ~x$w_buff0_used~0_In2063619855)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In2063619855|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2063619855, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2063619855, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2063619855, ~weak$$choice2~0=~weak$$choice2~0_In2063619855, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2063619855} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out2063619855|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2063619855, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2063619855, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out2063619855|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2063619855, ~weak$$choice2~0=~weak$$choice2~0_In2063619855, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2063619855} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 22:07:48,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1639301296 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1639301296 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1639301296 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1639301296 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1639301296|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1639301296| ~x$w_buff1_used~0_In-1639301296) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1639301296, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1639301296, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1639301296, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1639301296} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1639301296|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1639301296, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1639301296, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1639301296, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1639301296} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:07:48,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-161278624 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-161278624 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd1~0_Out-161278624 0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_Out-161278624 ~x$r_buff0_thd1~0_In-161278624) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-161278624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-161278624} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-161278624, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-161278624|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-161278624} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:07:48,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In-1470706006 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1470706006 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1470706006 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1470706006 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1470706006| ~x$r_buff1_thd1~0_In-1470706006) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1470706006| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1470706006, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1470706006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1470706006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1470706006} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1470706006, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1470706006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1470706006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1470706006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1470706006} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:07:48,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L742-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{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_7, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 22:07:48,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd2~0_60 v_~x$r_buff0_thd2~0_59)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 22:07:48,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1044495502 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out1044495502| |P1Thread1of1ForFork1_#t~ite29_Out1044495502|) (= ~x$r_buff1_thd2~0_In1044495502 |P1Thread1of1ForFork1_#t~ite29_Out1044495502|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1044495502 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In1044495502 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In1044495502 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1044495502 256))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1044495502| |P1Thread1of1ForFork1_#t~ite29_Out1044495502|) (= ~x$r_buff1_thd2~0_In1044495502 |P1Thread1of1ForFork1_#t~ite30_Out1044495502|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1044495502|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1044495502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1044495502, ~weak$$choice2~0=~weak$$choice2~0_In1044495502, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1044495502, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1044495502} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1044495502|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1044495502|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1044495502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1044495502, ~weak$$choice2~0=~weak$$choice2~0_In1044495502, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1044495502, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1044495502} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 22:07:48,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-18 22:07:48,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1959966183 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1959966183 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1959966183| ~x~0_In-1959966183)) (and (= ~x$w_buff1~0_In-1959966183 |P1Thread1of1ForFork1_#t~ite32_Out-1959966183|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1959966183, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1959966183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1959966183, ~x~0=~x~0_In-1959966183} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1959966183, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1959966183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1959966183, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1959966183|, ~x~0=~x~0_In-1959966183} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:07:48,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_16 |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|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:07:48,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1919650336 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1919650336 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1919650336|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1919650336 |P1Thread1of1ForFork1_#t~ite34_Out-1919650336|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1919650336, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1919650336} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1919650336|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1919650336, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1919650336} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:07:48,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-1602963248 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1602963248 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1602963248 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1602963248 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1602963248|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1602963248 |P1Thread1of1ForFork1_#t~ite35_Out-1602963248|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1602963248, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1602963248, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1602963248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1602963248} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1602963248, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1602963248, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1602963248|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1602963248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1602963248} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:07:48,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1917354609 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1917354609 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1917354609| ~x$r_buff0_thd2~0_In1917354609) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1917354609| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1917354609, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1917354609} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1917354609, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1917354609|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1917354609} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:07:48,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1782098364 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1782098364 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1782098364 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1782098364 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1782098364| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out1782098364| ~x$r_buff1_thd2~0_In1782098364) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1782098364, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1782098364, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1782098364, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1782098364} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1782098364, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1782098364, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1782098364, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1782098364|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1782098364} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:07:48,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_44 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:07:48,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$w_buff0_used~0_83 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_17 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:07:48,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1615173509 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1615173509 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1615173509| ~x~0_In1615173509) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1615173509| ~x$w_buff1~0_In1615173509) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1615173509, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1615173509, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1615173509, ~x~0=~x~0_In1615173509} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1615173509|, ~x$w_buff1~0=~x$w_buff1~0_In1615173509, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1615173509, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1615173509, ~x~0=~x~0_In1615173509} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 22:07:48,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-18 22:07:48,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1403990595 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1403990595 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1403990595| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1403990595| ~x$w_buff0_used~0_In-1403990595) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1403990595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1403990595} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1403990595, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1403990595|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1403990595} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 22:07:48,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1766725543 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1766725543 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1766725543 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1766725543 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1766725543|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1766725543 |ULTIMATE.start_main_#t~ite43_Out1766725543|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1766725543, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766725543, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1766725543, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766725543} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1766725543, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766725543, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1766725543|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1766725543, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766725543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:07:48,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In111479928 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In111479928 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out111479928| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In111479928 |ULTIMATE.start_main_#t~ite44_Out111479928|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In111479928, ~x$w_buff0_used~0=~x$w_buff0_used~0_In111479928} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In111479928, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out111479928|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In111479928} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:07:48,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In644100060 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In644100060 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In644100060 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In644100060 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In644100060 |ULTIMATE.start_main_#t~ite45_Out644100060|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out644100060|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In644100060, ~x$w_buff1_used~0=~x$w_buff1_used~0_In644100060, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In644100060, ~x$w_buff0_used~0=~x$w_buff0_used~0_In644100060} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In644100060, ~x$w_buff1_used~0=~x$w_buff1_used~0_In644100060, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In644100060, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out644100060|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In644100060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:07:48,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite45_14|) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y~0_13 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:07:48,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:07:48 BasicIcfg [2019-12-18 22:07:48,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:07:48,937 INFO L168 Benchmark]: Toolchain (without parser) took 15183.23 ms. Allocated memory was 138.9 MB in the beginning and 642.3 MB in the end (delta: 503.3 MB). Free memory was 102.3 MB in the beginning and 343.2 MB in the end (delta: -241.0 MB). Peak memory consumption was 262.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:07:48,938 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:07:48,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.09 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 157.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:07:48,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.20 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:07:48,940 INFO L168 Benchmark]: Boogie Preprocessor took 45.33 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:07:48,941 INFO L168 Benchmark]: RCFGBuilder took 786.09 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 108.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:07:48,942 INFO L168 Benchmark]: TraceAbstraction took 13531.24 ms. Allocated memory was 202.9 MB in the beginning and 642.3 MB in the end (delta: 439.4 MB). Free memory was 107.5 MB in the beginning and 343.2 MB in the end (delta: -235.7 MB). Peak memory consumption was 203.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:07:48,945 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.48 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.09 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 157.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.20 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.33 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.09 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 108.2 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13531.24 ms. Allocated memory was 202.9 MB in the beginning and 642.3 MB in the end (delta: 439.4 MB). Free memory was 107.5 MB in the beginning and 343.2 MB in the end (delta: -235.7 MB). Peak memory consumption was 203.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 147 ProgramPointsBefore, 80 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4527 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1632 SDtfs, 1717 SDslu, 2579 SDs, 0 SdLazy, 1439 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12676occurred 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: 3.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 7789 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 31643 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...