/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/safe022_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:49:01,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:49:01,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:49:01,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:49:01,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:49:01,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:49:01,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:49:01,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:49:01,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:49:01,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:49:01,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:49:01,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:49:01,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:49:01,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:49:01,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:49:01,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:49:01,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:49:01,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:49:01,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:49:01,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:49:01,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:49:01,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:49:01,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:49:01,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:49:01,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:49:01,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:49:01,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:49:01,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:49:01,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:49:01,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:49:01,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:49:01,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:49:01,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:49:01,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:49:01,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:49:01,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:49:01,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:49:01,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:49:01,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:49:01,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:49:01,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:49:01,542 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:49:01,557 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:49:01,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:49:01,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:49:01,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:49:01,560 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:49:01,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:49:01,561 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:49:01,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:49:01,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:49:01,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:49:01,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:49:01,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:49:01,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:49:01,562 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:49:01,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:49:01,562 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:49:01,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:49:01,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:49:01,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:49:01,564 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:49:01,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:49:01,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:49:01,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:49:01,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:49:01,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:49:01,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:49:01,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:49:01,566 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:49:01,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:49:01,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:49:01,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:49:01,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:49:01,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:49:01,867 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:49:01,868 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:49:01,869 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_pso.oepc.i [2019-12-18 22:49:01,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cac5090c/e13de5e0d4a44f9fa5b32a2ed7f2fe78/FLAG5a82f4c09 [2019-12-18 22:49:02,519 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:49:02,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_pso.oepc.i [2019-12-18 22:49:02,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cac5090c/e13de5e0d4a44f9fa5b32a2ed7f2fe78/FLAG5a82f4c09 [2019-12-18 22:49:02,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cac5090c/e13de5e0d4a44f9fa5b32a2ed7f2fe78 [2019-12-18 22:49:02,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:49:02,786 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:49:02,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:49:02,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:49:02,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:49:02,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:49:02" (1/1) ... [2019-12-18 22:49:02,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be7259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:02, skipping insertion in model container [2019-12-18 22:49:02,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:49:02" (1/1) ... [2019-12-18 22:49:02,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:49:02,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:49:03,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:49:03,408 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:49:03,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:49:03,546 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:49:03,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03 WrapperNode [2019-12-18 22:49:03,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:49:03,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:49:03,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:49:03,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:49:03,557 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:49:03" (1/1) ... [2019-12-18 22:49:03,578 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:49:03" (1/1) ... [2019-12-18 22:49:03,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:49:03,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:49:03,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:49:03,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:49:03,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03" (1/1) ... [2019-12-18 22:49:03,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03" (1/1) ... [2019-12-18 22:49:03,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03" (1/1) ... [2019-12-18 22:49:03,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03" (1/1) ... [2019-12-18 22:49:03,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03" (1/1) ... [2019-12-18 22:49:03,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03" (1/1) ... [2019-12-18 22:49:03,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03" (1/1) ... [2019-12-18 22:49:03,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:49:03,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:49:03,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:49:03,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:49:03,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03" (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:49:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:49:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:49:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:49:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:49:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:49:03,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:49:03,730 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:49:03,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:49:03,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:49:03,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:49:03,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:49:03,733 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:49:04,445 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:49:04,445 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:49:04,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:49:04 BoogieIcfgContainer [2019-12-18 22:49:04,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:49:04,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:49:04,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:49:04,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:49:04,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:49:02" (1/3) ... [2019-12-18 22:49:04,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d6aad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:49:04, skipping insertion in model container [2019-12-18 22:49:04,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:49:03" (2/3) ... [2019-12-18 22:49:04,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d6aad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:49:04, skipping insertion in model container [2019-12-18 22:49:04,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:49:04" (3/3) ... [2019-12-18 22:49:04,462 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_pso.oepc.i [2019-12-18 22:49:04,474 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:49:04,474 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:49:04,489 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:49:04,490 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:49:04,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,552 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,571 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,624 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,653 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:49:04,671 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:49:04,692 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:49:04,692 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:49:04,692 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:49:04,693 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:49:04,693 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:49:04,693 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:49:04,693 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:49:04,693 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:49:04,709 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 22:49:04,711 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 22:49:04,790 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 22:49:04,790 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:49:04,806 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 22:49:04,826 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 22:49:04,866 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 22:49:04,866 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:49:04,872 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 22:49:04,887 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 22:49:04,888 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:49:08,298 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 22:49:08,409 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 22:49:08,438 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-18 22:49:08,438 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 22:49:08,441 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-18 22:49:08,919 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-18 22:49:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-18 22:49:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:49:08,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:08,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:49:08,929 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:49:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:08,936 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-18 22:49:08,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:08,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448439562] [2019-12-18 22:49:08,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:09,179 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:49:09,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448439562] [2019-12-18 22:49:09,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:09,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:49:09,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094847779] [2019-12-18 22:49:09,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:49:09,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:49:09,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:49:09,211 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-18 22:49:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:09,489 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-18 22:49:09,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:49:09,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:49:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:09,609 INFO L225 Difference]: With dead ends: 7864 [2019-12-18 22:49:09,618 INFO L226 Difference]: Without dead ends: 7408 [2019-12-18 22:49:09,620 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:49:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-18 22:49:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-18 22:49:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-18 22:49:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-18 22:49:10,025 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-18 22:49:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:10,025 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-18 22:49:10,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:49:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-18 22:49:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:49:10,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:10,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:49:10,029 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:49:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-18 22:49:10,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:10,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196496444] [2019-12-18 22:49:10,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:10,176 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:49:10,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196496444] [2019-12-18 22:49:10,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:10,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:49:10,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226117074] [2019-12-18 22:49:10,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:49:10,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:10,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:49:10,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:49:10,180 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-18 22:49:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:10,310 INFO L93 Difference]: Finished difference Result 1719 states and 4310 transitions. [2019-12-18 22:49:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:49:10,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:49:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:10,318 INFO L225 Difference]: With dead ends: 1719 [2019-12-18 22:49:10,319 INFO L226 Difference]: Without dead ends: 1263 [2019-12-18 22:49:10,321 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:49:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2019-12-18 22:49:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2019-12-18 22:49:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-12-18 22:49:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2849 transitions. [2019-12-18 22:49:10,373 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2849 transitions. Word has length 11 [2019-12-18 22:49:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:10,373 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 2849 transitions. [2019-12-18 22:49:10,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:49:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2849 transitions. [2019-12-18 22:49:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:49:10,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:10,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:49:10,381 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:49:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-18 22:49:10,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:10,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240202076] [2019-12-18 22:49:10,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:10,523 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:49:10,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240202076] [2019-12-18 22:49:10,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:10,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:49:10,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116247717] [2019-12-18 22:49:10,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:49:10,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:10,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:49:10,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:49:10,526 INFO L87 Difference]: Start difference. First operand 1263 states and 2849 transitions. Second operand 5 states. [2019-12-18 22:49:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:10,801 INFO L93 Difference]: Finished difference Result 1830 states and 4011 transitions. [2019-12-18 22:49:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:49:10,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 22:49:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:10,811 INFO L225 Difference]: With dead ends: 1830 [2019-12-18 22:49:10,811 INFO L226 Difference]: Without dead ends: 1830 [2019-12-18 22:49:10,812 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:49:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-18 22:49:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1523. [2019-12-18 22:49:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-18 22:49:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3383 transitions. [2019-12-18 22:49:10,854 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3383 transitions. Word has length 14 [2019-12-18 22:49:10,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:10,855 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3383 transitions. [2019-12-18 22:49:10,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:49:10,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3383 transitions. [2019-12-18 22:49:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:49:10,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:10,859 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:49:10,859 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:49:10,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-18 22:49:10,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:10,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169920439] [2019-12-18 22:49:10,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:11,064 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:49:11,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169920439] [2019-12-18 22:49:11,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:11,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:49:11,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285511843] [2019-12-18 22:49:11,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:49:11,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:11,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:49:11,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:49:11,067 INFO L87 Difference]: Start difference. First operand 1523 states and 3383 transitions. Second operand 6 states. [2019-12-18 22:49:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:11,519 INFO L93 Difference]: Finished difference Result 2313 states and 4927 transitions. [2019-12-18 22:49:11,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:49:11,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 22:49:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:11,532 INFO L225 Difference]: With dead ends: 2313 [2019-12-18 22:49:11,533 INFO L226 Difference]: Without dead ends: 2260 [2019-12-18 22:49:11,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:49:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-18 22:49:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1600. [2019-12-18 22:49:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-18 22:49:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3528 transitions. [2019-12-18 22:49:11,574 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3528 transitions. Word has length 25 [2019-12-18 22:49:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:11,575 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3528 transitions. [2019-12-18 22:49:11,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:49:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3528 transitions. [2019-12-18 22:49:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:49:11,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:11,577 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:49:11,577 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:49:11,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash 607421545, now seen corresponding path program 1 times [2019-12-18 22:49:11,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:11,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331400724] [2019-12-18 22:49:11,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:11,623 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:49:11,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331400724] [2019-12-18 22:49:11,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:11,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:49:11,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324885873] [2019-12-18 22:49:11,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:49:11,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:11,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:49:11,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:49:11,626 INFO L87 Difference]: Start difference. First operand 1600 states and 3528 transitions. Second operand 3 states. [2019-12-18 22:49:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:11,636 INFO L93 Difference]: Finished difference Result 1599 states and 3526 transitions. [2019-12-18 22:49:11,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:49:11,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 22:49:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:11,646 INFO L225 Difference]: With dead ends: 1599 [2019-12-18 22:49:11,646 INFO L226 Difference]: Without dead ends: 1599 [2019-12-18 22:49:11,647 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:49:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-12-18 22:49:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2019-12-18 22:49:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-12-18 22:49:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 3526 transitions. [2019-12-18 22:49:11,683 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 3526 transitions. Word has length 26 [2019-12-18 22:49:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:11,683 INFO L462 AbstractCegarLoop]: Abstraction has 1599 states and 3526 transitions. [2019-12-18 22:49:11,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:49:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 3526 transitions. [2019-12-18 22:49:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:49:11,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:11,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:49:11,686 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:49:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1073597661, now seen corresponding path program 1 times [2019-12-18 22:49:11,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:11,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117655465] [2019-12-18 22:49:11,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:11,747 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:49:11,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117655465] [2019-12-18 22:49:11,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:11,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:49:11,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905728695] [2019-12-18 22:49:11,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:49:11,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:11,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:49:11,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:49:11,751 INFO L87 Difference]: Start difference. First operand 1599 states and 3526 transitions. Second operand 4 states. [2019-12-18 22:49:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:11,834 INFO L93 Difference]: Finished difference Result 2557 states and 5706 transitions. [2019-12-18 22:49:11,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:49:11,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 22:49:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:11,841 INFO L225 Difference]: With dead ends: 2557 [2019-12-18 22:49:11,841 INFO L226 Difference]: Without dead ends: 1126 [2019-12-18 22:49:11,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:49:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-12-18 22:49:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2019-12-18 22:49:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2019-12-18 22:49:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 2480 transitions. [2019-12-18 22:49:11,866 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 2480 transitions. Word has length 27 [2019-12-18 22:49:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:11,866 INFO L462 AbstractCegarLoop]: Abstraction has 1126 states and 2480 transitions. [2019-12-18 22:49:11,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:49:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 2480 transitions. [2019-12-18 22:49:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:49:11,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:11,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:49:11,869 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:49:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1653898327, now seen corresponding path program 2 times [2019-12-18 22:49:11,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:11,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593078574] [2019-12-18 22:49:11,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:11,944 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:49:11,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593078574] [2019-12-18 22:49:11,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:11,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:49:11,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062996759] [2019-12-18 22:49:11,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:49:11,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:49:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:49:11,946 INFO L87 Difference]: Start difference. First operand 1126 states and 2480 transitions. Second operand 5 states. [2019-12-18 22:49:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:12,417 INFO L93 Difference]: Finished difference Result 1824 states and 3932 transitions. [2019-12-18 22:49:12,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:49:12,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 22:49:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:12,427 INFO L225 Difference]: With dead ends: 1824 [2019-12-18 22:49:12,427 INFO L226 Difference]: Without dead ends: 1824 [2019-12-18 22:49:12,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:49:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-12-18 22:49:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1628. [2019-12-18 22:49:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-12-18 22:49:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 3557 transitions. [2019-12-18 22:49:12,463 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 3557 transitions. Word has length 27 [2019-12-18 22:49:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:12,463 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 3557 transitions. [2019-12-18 22:49:12,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:49:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 3557 transitions. [2019-12-18 22:49:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:49:12,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:12,466 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:49:12,466 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:49:12,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:12,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1580443706, now seen corresponding path program 1 times [2019-12-18 22:49:12,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:12,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343004411] [2019-12-18 22:49:12,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:12,579 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:49:12,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343004411] [2019-12-18 22:49:12,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:12,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:49:12,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227479340] [2019-12-18 22:49:12,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:49:12,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:49:12,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:49:12,582 INFO L87 Difference]: Start difference. First operand 1628 states and 3557 transitions. Second operand 5 states. [2019-12-18 22:49:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:12,622 INFO L93 Difference]: Finished difference Result 953 states and 1972 transitions. [2019-12-18 22:49:12,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:49:12,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 22:49:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:12,628 INFO L225 Difference]: With dead ends: 953 [2019-12-18 22:49:12,628 INFO L226 Difference]: Without dead ends: 822 [2019-12-18 22:49:12,628 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:49:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-18 22:49:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 780. [2019-12-18 22:49:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-18 22:49:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1655 transitions. [2019-12-18 22:49:12,644 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1655 transitions. Word has length 28 [2019-12-18 22:49:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:12,645 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1655 transitions. [2019-12-18 22:49:12,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:49:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1655 transitions. [2019-12-18 22:49:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 22:49:12,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:12,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:49:12,648 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:49:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:12,648 INFO L82 PathProgramCache]: Analyzing trace with hash -391470674, now seen corresponding path program 1 times [2019-12-18 22:49:12,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:12,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118014776] [2019-12-18 22:49:12,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:12,746 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:49:12,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118014776] [2019-12-18 22:49:12,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:12,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:49:12,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296851005] [2019-12-18 22:49:12,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:49:12,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:49:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:49:12,749 INFO L87 Difference]: Start difference. First operand 780 states and 1655 transitions. Second operand 7 states. [2019-12-18 22:49:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:12,939 INFO L93 Difference]: Finished difference Result 1358 states and 2799 transitions. [2019-12-18 22:49:12,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:49:12,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 22:49:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:12,942 INFO L225 Difference]: With dead ends: 1358 [2019-12-18 22:49:12,942 INFO L226 Difference]: Without dead ends: 910 [2019-12-18 22:49:12,943 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:49:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-12-18 22:49:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 771. [2019-12-18 22:49:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-12-18 22:49:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1621 transitions. [2019-12-18 22:49:12,959 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1621 transitions. Word has length 51 [2019-12-18 22:49:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:12,959 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1621 transitions. [2019-12-18 22:49:12,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:49:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1621 transitions. [2019-12-18 22:49:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 22:49:12,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:12,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:49:12,962 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:49:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash -167213104, now seen corresponding path program 2 times [2019-12-18 22:49:12,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:12,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388259748] [2019-12-18 22:49:12,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:13,104 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:49:13,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388259748] [2019-12-18 22:49:13,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:13,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:49:13,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942276620] [2019-12-18 22:49:13,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:49:13,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:13,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:49:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:49:13,107 INFO L87 Difference]: Start difference. First operand 771 states and 1621 transitions. Second operand 5 states. [2019-12-18 22:49:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:13,306 INFO L93 Difference]: Finished difference Result 900 states and 1854 transitions. [2019-12-18 22:49:13,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:49:13,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 22:49:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:13,310 INFO L225 Difference]: With dead ends: 900 [2019-12-18 22:49:13,310 INFO L226 Difference]: Without dead ends: 900 [2019-12-18 22:49:13,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:49:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-18 22:49:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 812. [2019-12-18 22:49:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2019-12-18 22:49:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1701 transitions. [2019-12-18 22:49:13,327 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1701 transitions. Word has length 51 [2019-12-18 22:49:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:13,328 INFO L462 AbstractCegarLoop]: Abstraction has 812 states and 1701 transitions. [2019-12-18 22:49:13,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:49:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1701 transitions. [2019-12-18 22:49:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 22:49:13,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:13,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:49:13,331 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:49:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1526869514, now seen corresponding path program 3 times [2019-12-18 22:49:13,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:13,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635234623] [2019-12-18 22:49:13,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:13,432 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:49:13,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635234623] [2019-12-18 22:49:13,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:13,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:49:13,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695095988] [2019-12-18 22:49:13,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:49:13,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:49:13,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:49:13,434 INFO L87 Difference]: Start difference. First operand 812 states and 1701 transitions. Second operand 3 states. [2019-12-18 22:49:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:13,450 INFO L93 Difference]: Finished difference Result 811 states and 1699 transitions. [2019-12-18 22:49:13,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:49:13,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 22:49:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:13,453 INFO L225 Difference]: With dead ends: 811 [2019-12-18 22:49:13,453 INFO L226 Difference]: Without dead ends: 811 [2019-12-18 22:49:13,454 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:49:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-12-18 22:49:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 700. [2019-12-18 22:49:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-12-18 22:49:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1496 transitions. [2019-12-18 22:49:13,468 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1496 transitions. Word has length 51 [2019-12-18 22:49:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:13,469 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 1496 transitions. [2019-12-18 22:49:13,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:49:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1496 transitions. [2019-12-18 22:49:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 22:49:13,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:13,471 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:49:13,471 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:49:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:13,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1511703527, now seen corresponding path program 1 times [2019-12-18 22:49:13,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:13,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319932382] [2019-12-18 22:49:13,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:49:13,584 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:49:13,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319932382] [2019-12-18 22:49:13,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:49:13,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:49:13,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018092466] [2019-12-18 22:49:13,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:49:13,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:49:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:49:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:49:13,586 INFO L87 Difference]: Start difference. First operand 700 states and 1496 transitions. Second operand 5 states. [2019-12-18 22:49:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:49:13,651 INFO L93 Difference]: Finished difference Result 890 states and 1889 transitions. [2019-12-18 22:49:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:49:13,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 22:49:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:49:13,654 INFO L225 Difference]: With dead ends: 890 [2019-12-18 22:49:13,655 INFO L226 Difference]: Without dead ends: 890 [2019-12-18 22:49:13,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:49:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-18 22:49:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 727. [2019-12-18 22:49:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-12-18 22:49:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1558 transitions. [2019-12-18 22:49:13,669 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1558 transitions. Word has length 52 [2019-12-18 22:49:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:49:13,670 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1558 transitions. [2019-12-18 22:49:13,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:49:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1558 transitions. [2019-12-18 22:49:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 22:49:13,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:49:13,672 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:49:13,672 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:49:13,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:49:13,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-18 22:49:13,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:49:13,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017745349] [2019-12-18 22:49:13,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:49:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:49:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:49:13,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:49:13,787 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:49:13,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~x~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t2309~0.offset_19|) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= 0 v_~y$mem_tmp~0_9) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2309~0.base_24|)) (= 0 v_~y$r_buff1_thd1~0_21) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t2309~0.base_24| 1)) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2309~0.base_24| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2309~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2309~0.base_24|) |v_ULTIMATE.start_main_~#t2309~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$r_buff0_thd2~0_83 0) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$w_buff0_used~0_106 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~y$r_buff1_thd2~0_52) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2309~0.base_24|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_~#t2309~0.offset=|v_ULTIMATE.start_main_~#t2309~0.offset_19|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2309~0.base=|v_ULTIMATE.start_main_~#t2309~0.base_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t2310~0.offset=|v_ULTIMATE.start_main_~#t2310~0.offset_19|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2310~0.base=|v_ULTIMATE.start_main_~#t2310~0.base_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2309~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2309~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2310~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2310~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:49:13,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2310~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2310~0.base_13|) (= |v_ULTIMATE.start_main_~#t2310~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2310~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2310~0.base_13| 4)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2310~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2310~0.base_13|) |v_ULTIMATE.start_main_~#t2310~0.offset_11| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2310~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2310~0.offset=|v_ULTIMATE.start_main_~#t2310~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t2310~0.base=|v_ULTIMATE.start_main_~#t2310~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2310~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2310~0.base, #length] because there is no mapped edge [2019-12-18 22:49:13,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= 1 ~x~0_Out-539213194) (= ~y$r_buff0_thd1~0_In-539213194 ~y$r_buff1_thd1~0_Out-539213194) (= 1 ~y$r_buff0_thd1~0_Out-539213194) (= ~y$r_buff0_thd2~0_In-539213194 ~y$r_buff1_thd2~0_Out-539213194) (= ~y$r_buff1_thd0~0_Out-539213194 ~y$r_buff0_thd0~0_In-539213194) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-539213194))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-539213194, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-539213194, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-539213194, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-539213194} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-539213194, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-539213194, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-539213194, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-539213194, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-539213194, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-539213194, ~x~0=~x~0_Out-539213194, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-539213194} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:49:13,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In737241430 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In737241430 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out737241430|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out737241430| ~y$w_buff0_used~0_In737241430) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In737241430, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In737241430} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out737241430|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In737241430, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In737241430} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:49:13,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1117215444 256) 0))) (or (and .cse0 (= ~y$w_buff0_used~0_In-1117215444 |P1Thread1of1ForFork1_#t~ite20_Out-1117215444|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1117215444 256)))) (or (= (mod ~y$w_buff0_used~0_In-1117215444 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1117215444 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1117215444 256))))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1117215444| |P1Thread1of1ForFork1_#t~ite20_Out-1117215444|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1117215444| |P1Thread1of1ForFork1_#t~ite20_Out-1117215444|) (not .cse0) (= ~y$w_buff0_used~0_In-1117215444 |P1Thread1of1ForFork1_#t~ite21_Out-1117215444|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1117215444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117215444, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1117215444|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1117215444, ~weak$$choice2~0=~weak$$choice2~0_In-1117215444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117215444} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1117215444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117215444, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1117215444|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1117215444, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1117215444|, ~weak$$choice2~0=~weak$$choice2~0_In-1117215444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117215444} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 22:49:13,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse4 (= (mod ~y$r_buff1_thd2~0_In-1873662327 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1873662327 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1873662327 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1873662327| |P1Thread1of1ForFork1_#t~ite24_Out-1873662327|)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1873662327 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1873662327 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-1873662327| |P1Thread1of1ForFork1_#t~ite22_Out-1873662327|) (or (and (= ~y$w_buff1_used~0_In-1873662327 |P1Thread1of1ForFork1_#t~ite24_Out-1873662327|) (= |P1Thread1of1ForFork1_#t~ite23_Out-1873662327| |P1Thread1of1ForFork1_#t~ite23_In-1873662327|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1873662327| ~y$w_buff1_used~0_In-1873662327) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse0 .cse5))) (let ((.cse6 (not .cse2))) (and (or (not .cse4) .cse6) (= |P1Thread1of1ForFork1_#t~ite23_Out-1873662327| |P1Thread1of1ForFork1_#t~ite22_Out-1873662327|) (= |P1Thread1of1ForFork1_#t~ite22_Out-1873662327| 0) (or .cse6 (not .cse1)) .cse0 .cse5 (not .cse3))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1873662327, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1873662327, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1873662327, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1873662327|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1873662327|, ~weak$$choice2~0=~weak$$choice2~0_In-1873662327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1873662327} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1873662327, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1873662327, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1873662327, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1873662327|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1873662327|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1873662327|, ~weak$$choice2~0=~weak$$choice2~0_In-1873662327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1873662327} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 22:49:13,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 22:49:13,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In1770504772 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1770504772 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1770504772 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1770504772 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1770504772|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1770504772 |P0Thread1of1ForFork0_#t~ite6_Out1770504772|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1770504772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770504772, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1770504772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770504772} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1770504772|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1770504772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770504772, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1770504772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770504772} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:49:13,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1994552223 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1994552223 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out1994552223 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out1994552223 ~y$r_buff0_thd1~0_In1994552223)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1994552223, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1994552223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1994552223, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1994552223|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1994552223} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:49:13,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out1652744000| |P1Thread1of1ForFork1_#t~ite30_Out1652744000|)) (.cse1 (= (mod ~y$w_buff1_used~0_In1652744000 256) 0)) (.cse5 (= (mod ~y$w_buff0_used~0_In1652744000 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In1652744000 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In1652744000 256))) (.cse3 (= (mod ~weak$$choice2~0_In1652744000 256) 0))) (or (let ((.cse2 (not .cse6))) (and .cse0 (or (not .cse1) .cse2) (= |P1Thread1of1ForFork1_#t~ite29_Out1652744000| |P1Thread1of1ForFork1_#t~ite28_Out1652744000|) .cse3 (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1652744000|) (or .cse2 (not .cse4)) (not .cse5))) (and (or (and .cse0 .cse3 (or (and .cse1 .cse6) .cse5 (and .cse4 .cse6)) (= |P1Thread1of1ForFork1_#t~ite29_Out1652744000| ~y$r_buff1_thd2~0_In1652744000)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1652744000| |P1Thread1of1ForFork1_#t~ite29_In1652744000|) (not .cse3) (= ~y$r_buff1_thd2~0_In1652744000 |P1Thread1of1ForFork1_#t~ite30_Out1652744000|))) (= |P1Thread1of1ForFork1_#t~ite28_In1652744000| |P1Thread1of1ForFork1_#t~ite28_Out1652744000|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1652744000, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1652744000|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1652744000, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1652744000, ~weak$$choice2~0=~weak$$choice2~0_In1652744000, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1652744000|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1652744000} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1652744000, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1652744000|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1652744000|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1652744000, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1652744000, ~weak$$choice2~0=~weak$$choice2~0_In1652744000, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1652744000|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1652744000} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 22:49:13,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1350305789 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1350305789 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1350305789 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1350305789 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1350305789| ~y$r_buff1_thd1~0_In-1350305789)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1350305789|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1350305789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1350305789, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1350305789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1350305789} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1350305789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1350305789, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1350305789|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1350305789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1350305789} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:49:13,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 22:49:13,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-693686578 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-693686578 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-693686578 |P1Thread1of1ForFork1_#t~ite32_Out-693686578|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-693686578 |P1Thread1of1ForFork1_#t~ite32_Out-693686578|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-693686578, ~y$w_buff1~0=~y$w_buff1~0_In-693686578, ~y~0=~y~0_In-693686578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-693686578} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-693686578, ~y$w_buff1~0=~y$w_buff1~0_In-693686578, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-693686578|, ~y~0=~y~0_In-693686578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-693686578} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:49:13,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 22:49:13,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1116530410 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1116530410 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1116530410| ~y$w_buff0_used~0_In1116530410)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1116530410|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1116530410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1116530410} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1116530410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1116530410, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1116530410|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:49:13,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1749037795 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1749037795 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1749037795 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1749037795 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1749037795| ~y$w_buff1_used~0_In-1749037795)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1749037795|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1749037795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749037795, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1749037795, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749037795} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1749037795, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749037795, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1749037795, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1749037795|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749037795} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:49:13,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-393156955 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-393156955 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-393156955| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-393156955 |P1Thread1of1ForFork1_#t~ite36_Out-393156955|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-393156955, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-393156955} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-393156955, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-393156955, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-393156955|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:49:13,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1156533772 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1156533772 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1156533772 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1156533772 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1156533772|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1156533772 |P1Thread1of1ForFork1_#t~ite37_Out-1156533772|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1156533772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1156533772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1156533772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1156533772} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1156533772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1156533772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1156533772, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1156533772|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1156533772} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:49:13,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:49:13,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:49:13,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:49:13,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-863024716 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-863024716 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-863024716 |ULTIMATE.start_main_#t~ite40_Out-863024716|) (not .cse1)) (and (= ~y~0_In-863024716 |ULTIMATE.start_main_#t~ite40_Out-863024716|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-863024716, ~y~0=~y~0_In-863024716, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-863024716, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-863024716} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-863024716|, ~y$w_buff1~0=~y$w_buff1~0_In-863024716, ~y~0=~y~0_In-863024716, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-863024716, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-863024716} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 22:49:13,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 22:49:13,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1209438279 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1209438279 256)))) (or (and (= ~y$w_buff0_used~0_In1209438279 |ULTIMATE.start_main_#t~ite42_Out1209438279|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1209438279|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1209438279, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1209438279} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1209438279, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1209438279, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1209438279|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 22:49:13,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In331783502 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In331783502 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In331783502 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In331783502 256)))) (or (and (= ~y$w_buff1_used~0_In331783502 |ULTIMATE.start_main_#t~ite43_Out331783502|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out331783502| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In331783502, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In331783502, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In331783502, ~y$w_buff1_used~0=~y$w_buff1_used~0_In331783502} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In331783502, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In331783502, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out331783502|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In331783502, ~y$w_buff1_used~0=~y$w_buff1_used~0_In331783502} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:49:13,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1411466570 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1411466570 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1411466570|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-1411466570 |ULTIMATE.start_main_#t~ite44_Out-1411466570|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1411466570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1411466570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1411466570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1411466570, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1411466570|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:49:13,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2102237242 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2102237242 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-2102237242 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2102237242 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-2102237242| ~y$r_buff1_thd0~0_In-2102237242) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-2102237242|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2102237242, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2102237242, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2102237242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2102237242} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2102237242, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2102237242, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2102237242, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2102237242|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2102237242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:49:13,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:49:13,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:49:13 BasicIcfg [2019-12-18 22:49:13,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:49:13,900 INFO L168 Benchmark]: Toolchain (without parser) took 11114.65 ms. Allocated memory was 137.9 MB in the beginning and 391.6 MB in the end (delta: 253.8 MB). Free memory was 101.6 MB in the beginning and 167.2 MB in the end (delta: -65.6 MB). Peak memory consumption was 188.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:49:13,901 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:49:13,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.51 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.1 MB in the beginning and 157.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:49:13,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.93 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 155.0 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:49:13,903 INFO L168 Benchmark]: Boogie Preprocessor took 38.39 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:49:13,904 INFO L168 Benchmark]: RCFGBuilder took 792.69 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 108.3 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:49:13,904 INFO L168 Benchmark]: TraceAbstraction took 9449.44 ms. Allocated memory was 202.9 MB in the beginning and 391.6 MB in the end (delta: 188.7 MB). Free memory was 108.3 MB in the beginning and 167.2 MB in the end (delta: -58.9 MB). Peak memory consumption was 129.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:49:13,908 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.51 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.51 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.1 MB in the beginning and 157.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.93 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.39 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.69 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 108.3 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9449.44 ms. Allocated memory was 202.9 MB in the beginning and 391.6 MB in the end (delta: 188.7 MB). Free memory was 108.3 MB in the beginning and 167.2 MB in the end (delta: -58.9 MB). Peak memory consumption was 129.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4545 VarBasedMoverChecksPositive, 161 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2309, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2310, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1282 SDtfs, 1365 SDslu, 2319 SDs, 0 SdLazy, 1212 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8010occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 1706 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 69266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...