/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:28:59,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:28:59,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:28:59,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:28:59,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:28:59,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:28:59,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:28:59,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:28:59,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:28:59,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:28:59,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:28:59,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:28:59,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:28:59,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:28:59,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:28:59,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:28:59,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:28:59,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:28:59,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:28:59,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:28:59,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:28:59,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:28:59,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:28:59,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:28:59,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:28:59,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:28:59,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:28:59,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:28:59,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:28:59,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:28:59,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:28:59,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:28:59,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:28:59,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:28:59,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:28:59,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:28:59,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:28:59,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:28:59,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:28:59,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:28:59,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:28:59,409 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-SemanticLbe-MCR.epf [2019-12-27 18:28:59,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:28:59,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:28:59,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:28:59,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:28:59,433 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:28:59,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:28:59,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:28:59,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:28:59,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:28:59,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:28:59,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:28:59,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:28:59,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:28:59,436 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:28:59,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:28:59,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:28:59,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:28:59,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:28:59,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:28:59,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:28:59,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:28:59,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:28:59,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:28:59,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:28:59,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:28:59,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:28:59,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:28:59,440 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:28:59,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:28:59,440 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:28:59,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:28:59,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:28:59,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:28:59,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:28:59,798 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:28:59,799 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:28:59,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2019-12-27 18:28:59,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49c1fb32/e830df61b3c74c8792896ce4d0adda45/FLAG26cd98518 [2019-12-27 18:29:00,460 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:29:00,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2019-12-27 18:29:00,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49c1fb32/e830df61b3c74c8792896ce4d0adda45/FLAG26cd98518 [2019-12-27 18:29:00,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49c1fb32/e830df61b3c74c8792896ce4d0adda45 [2019-12-27 18:29:00,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:29:00,715 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:29:00,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:29:00,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:29:00,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:29:00,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:00" (1/1) ... [2019-12-27 18:29:00,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23abe169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:00, skipping insertion in model container [2019-12-27 18:29:00,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:00" (1/1) ... [2019-12-27 18:29:00,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:29:00,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:29:01,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:29:01,405 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:29:01,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:29:01,565 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:29:01,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01 WrapperNode [2019-12-27 18:29:01,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:29:01,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:29:01,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:29:01,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:29:01,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... [2019-12-27 18:29:01,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... [2019-12-27 18:29:01,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:29:01,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:29:01,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:29:01,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:29:01,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... [2019-12-27 18:29:01,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... [2019-12-27 18:29:01,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... [2019-12-27 18:29:01,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... [2019-12-27 18:29:01,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... [2019-12-27 18:29:01,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... [2019-12-27 18:29:01,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... [2019-12-27 18:29:01,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:29:01,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:29:01,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:29:01,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:29:01,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:29:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:29:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:29:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:29:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:29:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:29:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:29:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:29:01,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:29:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:29:01,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:29:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:29:01,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:29:01,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:29:01,764 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:29:02,539 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:29:02,540 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:29:02,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:02 BoogieIcfgContainer [2019-12-27 18:29:02,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:29:02,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:29:02,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:29:02,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:29:02,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:29:00" (1/3) ... [2019-12-27 18:29:02,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:02, skipping insertion in model container [2019-12-27 18:29:02,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:01" (2/3) ... [2019-12-27 18:29:02,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:02, skipping insertion in model container [2019-12-27 18:29:02,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:02" (3/3) ... [2019-12-27 18:29:02,551 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_power.opt.i [2019-12-27 18:29:02,562 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:29:02,563 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:29:02,571 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:29:02,572 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:29:02,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,621 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,621 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,621 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,654 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,659 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,665 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,666 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:29:02,683 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:29:02,724 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:29:02,724 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:29:02,724 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:29:02,725 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:29:02,725 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:29:02,725 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:29:02,725 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:29:02,725 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:29:02,752 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 18:29:02,754 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:29:02,877 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:29:02,877 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:29:02,892 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:29:02,914 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:29:02,969 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:29:02,969 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:29:02,977 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:29:02,997 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 18:29:02,998 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:29:07,949 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-27 18:29:08,056 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 18:29:08,197 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 18:29:08,326 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:29:08,356 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91392 [2019-12-27 18:29:08,356 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:29:08,360 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-27 18:29:27,378 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118050 states. [2019-12-27 18:29:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 118050 states. [2019-12-27 18:29:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:29:27,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:29:27,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:29:27,390 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:29:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:29:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash 815309389, now seen corresponding path program 1 times [2019-12-27 18:29:27,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:29:27,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405415270] [2019-12-27 18:29:27,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:29:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:29:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:29:27,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405415270] [2019-12-27 18:29:27,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:29:27,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:29:27,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1740449522] [2019-12-27 18:29:27,723 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:29:27,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:29:27,739 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:29:27,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:29:27,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:29:27,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:29:27,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:29:27,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:29:27,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:29:27,759 INFO L87 Difference]: Start difference. First operand 118050 states. Second operand 3 states. [2019-12-27 18:29:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:29:28,997 INFO L93 Difference]: Finished difference Result 117660 states and 502246 transitions. [2019-12-27 18:29:28,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:29:28,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:29:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:29:33,015 INFO L225 Difference]: With dead ends: 117660 [2019-12-27 18:29:33,016 INFO L226 Difference]: Without dead ends: 115112 [2019-12-27 18:29:33,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:29:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115112 states. [2019-12-27 18:29:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115112 to 115112. [2019-12-27 18:29:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115112 states. [2019-12-27 18:29:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115112 states to 115112 states and 491858 transitions. [2019-12-27 18:29:40,202 INFO L78 Accepts]: Start accepts. Automaton has 115112 states and 491858 transitions. Word has length 5 [2019-12-27 18:29:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:29:40,203 INFO L462 AbstractCegarLoop]: Abstraction has 115112 states and 491858 transitions. [2019-12-27 18:29:40,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:29:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states and 491858 transitions. [2019-12-27 18:29:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:29:40,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:29:40,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:29:40,207 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:29:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:29:40,208 INFO L82 PathProgramCache]: Analyzing trace with hash 162612621, now seen corresponding path program 1 times [2019-12-27 18:29:40,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:29:40,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952104230] [2019-12-27 18:29:40,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:29:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:29:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:29:40,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952104230] [2019-12-27 18:29:40,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:29:40,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:29:40,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891493917] [2019-12-27 18:29:40,304 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:29:40,305 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:29:40,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 18:29:40,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:29:40,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:29:40,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:29:40,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:29:40,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:29:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:29:40,348 INFO L87 Difference]: Start difference. First operand 115112 states and 491858 transitions. Second operand 5 states. [2019-12-27 18:29:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:29:45,623 INFO L93 Difference]: Finished difference Result 180042 states and 739573 transitions. [2019-12-27 18:29:45,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:29:45,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 18:29:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:29:46,881 INFO L225 Difference]: With dead ends: 180042 [2019-12-27 18:29:46,882 INFO L226 Difference]: Without dead ends: 179993 [2019-12-27 18:29:46,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:29:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179993 states. [2019-12-27 18:29:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179993 to 166069. [2019-12-27 18:29:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166069 states. [2019-12-27 18:30:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166069 states to 166069 states and 689057 transitions. [2019-12-27 18:30:06,078 INFO L78 Accepts]: Start accepts. Automaton has 166069 states and 689057 transitions. Word has length 11 [2019-12-27 18:30:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:06,079 INFO L462 AbstractCegarLoop]: Abstraction has 166069 states and 689057 transitions. [2019-12-27 18:30:06,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:30:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 166069 states and 689057 transitions. [2019-12-27 18:30:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:30:06,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:06,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:06,087 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:06,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1907433687, now seen corresponding path program 1 times [2019-12-27 18:30:06,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:06,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147819876] [2019-12-27 18:30:06,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:06,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147819876] [2019-12-27 18:30:06,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:06,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:30:06,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1496828711] [2019-12-27 18:30:06,167 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:06,169 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:06,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:30:06,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:06,171 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:06,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:30:06,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:06,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:30:06,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:30:06,172 INFO L87 Difference]: Start difference. First operand 166069 states and 689057 transitions. Second operand 4 states. [2019-12-27 18:30:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:07,623 INFO L93 Difference]: Finished difference Result 237299 states and 961992 transitions. [2019-12-27 18:30:07,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:30:07,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:30:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:10,095 INFO L225 Difference]: With dead ends: 237299 [2019-12-27 18:30:10,095 INFO L226 Difference]: Without dead ends: 237236 [2019-12-27 18:30:10,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237236 states. [2019-12-27 18:30:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237236 to 202025. [2019-12-27 18:30:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202025 states. [2019-12-27 18:30:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202025 states to 202025 states and 831679 transitions. [2019-12-27 18:30:27,383 INFO L78 Accepts]: Start accepts. Automaton has 202025 states and 831679 transitions. Word has length 13 [2019-12-27 18:30:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:27,384 INFO L462 AbstractCegarLoop]: Abstraction has 202025 states and 831679 transitions. [2019-12-27 18:30:27,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:30:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 202025 states and 831679 transitions. [2019-12-27 18:30:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:30:27,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:27,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:27,388 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1457610254, now seen corresponding path program 1 times [2019-12-27 18:30:27,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:27,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070536002] [2019-12-27 18:30:27,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:27,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070536002] [2019-12-27 18:30:27,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:27,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:30:27,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [897903187] [2019-12-27 18:30:27,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:27,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:27,474 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:30:27,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:27,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:27,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:27,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:27,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:27,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:27,475 INFO L87 Difference]: Start difference. First operand 202025 states and 831679 transitions. Second operand 3 states. [2019-12-27 18:30:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:27,620 INFO L93 Difference]: Finished difference Result 39500 states and 127344 transitions. [2019-12-27 18:30:27,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:27,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:30:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:27,697 INFO L225 Difference]: With dead ends: 39500 [2019-12-27 18:30:27,697 INFO L226 Difference]: Without dead ends: 39500 [2019-12-27 18:30:27,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39500 states. [2019-12-27 18:30:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39500 to 39500. [2019-12-27 18:30:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39500 states. [2019-12-27 18:30:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39500 states to 39500 states and 127344 transitions. [2019-12-27 18:30:28,478 INFO L78 Accepts]: Start accepts. Automaton has 39500 states and 127344 transitions. Word has length 13 [2019-12-27 18:30:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:28,478 INFO L462 AbstractCegarLoop]: Abstraction has 39500 states and 127344 transitions. [2019-12-27 18:30:28,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 39500 states and 127344 transitions. [2019-12-27 18:30:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:30:28,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:28,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:28,483 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash -440148133, now seen corresponding path program 1 times [2019-12-27 18:30:28,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:28,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101218926] [2019-12-27 18:30:28,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:28,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101218926] [2019-12-27 18:30:28,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:28,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:30:28,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4753160] [2019-12-27 18:30:28,551 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:28,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:28,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 77 transitions. [2019-12-27 18:30:28,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:28,630 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:30:28,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:30:28,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:28,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:30:28,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:30:28,631 INFO L87 Difference]: Start difference. First operand 39500 states and 127344 transitions. Second operand 7 states. [2019-12-27 18:30:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:30,923 INFO L93 Difference]: Finished difference Result 52847 states and 167054 transitions. [2019-12-27 18:30:30,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:30:30,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 18:30:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:31,006 INFO L225 Difference]: With dead ends: 52847 [2019-12-27 18:30:31,006 INFO L226 Difference]: Without dead ends: 52834 [2019-12-27 18:30:31,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:30:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52834 states. [2019-12-27 18:30:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52834 to 39960. [2019-12-27 18:30:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39960 states. [2019-12-27 18:30:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39960 states to 39960 states and 128654 transitions. [2019-12-27 18:30:31,754 INFO L78 Accepts]: Start accepts. Automaton has 39960 states and 128654 transitions. Word has length 19 [2019-12-27 18:30:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:31,754 INFO L462 AbstractCegarLoop]: Abstraction has 39960 states and 128654 transitions. [2019-12-27 18:30:31,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:30:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 39960 states and 128654 transitions. [2019-12-27 18:30:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:30:31,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:31,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:31,769 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:31,769 INFO L82 PathProgramCache]: Analyzing trace with hash -79667593, now seen corresponding path program 1 times [2019-12-27 18:30:31,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:31,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036526961] [2019-12-27 18:30:31,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:31,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036526961] [2019-12-27 18:30:31,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:31,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:30:31,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939752374] [2019-12-27 18:30:31,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:31,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:31,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 18:30:31,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:31,896 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:30:31,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:30:31,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:30:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:30:31,898 INFO L87 Difference]: Start difference. First operand 39960 states and 128654 transitions. Second operand 6 states. [2019-12-27 18:30:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:31,954 INFO L93 Difference]: Finished difference Result 7841 states and 21500 transitions. [2019-12-27 18:30:31,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:30:31,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 18:30:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:31,964 INFO L225 Difference]: With dead ends: 7841 [2019-12-27 18:30:31,964 INFO L226 Difference]: Without dead ends: 7841 [2019-12-27 18:30:31,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:30:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7841 states. [2019-12-27 18:30:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7841 to 7701. [2019-12-27 18:30:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-12-27 18:30:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 21100 transitions. [2019-12-27 18:30:32,060 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 21100 transitions. Word has length 25 [2019-12-27 18:30:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:32,061 INFO L462 AbstractCegarLoop]: Abstraction has 7701 states and 21100 transitions. [2019-12-27 18:30:32,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:30:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 21100 transitions. [2019-12-27 18:30:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:30:32,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:32,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:32,073 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash -832696622, now seen corresponding path program 1 times [2019-12-27 18:30:32,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:32,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781630519] [2019-12-27 18:30:32,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:32,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781630519] [2019-12-27 18:30:32,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:32,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:30:32,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1612914546] [2019-12-27 18:30:32,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:32,177 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:32,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 109 transitions. [2019-12-27 18:30:32,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:32,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:32,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:30:32,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:30:32,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:32,204 INFO L87 Difference]: Start difference. First operand 7701 states and 21100 transitions. Second operand 5 states. [2019-12-27 18:30:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:32,247 INFO L93 Difference]: Finished difference Result 5712 states and 16440 transitions. [2019-12-27 18:30:32,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:30:32,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:30:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:32,255 INFO L225 Difference]: With dead ends: 5712 [2019-12-27 18:30:32,255 INFO L226 Difference]: Without dead ends: 5712 [2019-12-27 18:30:32,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2019-12-27 18:30:32,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 5299. [2019-12-27 18:30:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 18:30:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 15323 transitions. [2019-12-27 18:30:32,330 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 15323 transitions. Word has length 37 [2019-12-27 18:30:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:32,330 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 15323 transitions. [2019-12-27 18:30:32,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:30:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 15323 transitions. [2019-12-27 18:30:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:30:32,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:32,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:32,338 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:32,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:32,339 INFO L82 PathProgramCache]: Analyzing trace with hash -49475536, now seen corresponding path program 1 times [2019-12-27 18:30:32,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:32,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997375429] [2019-12-27 18:30:32,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:32,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997375429] [2019-12-27 18:30:32,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:32,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:30:32,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1427148594] [2019-12-27 18:30:32,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:32,453 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:34,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 250 transitions. [2019-12-27 18:30:34,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:34,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:34,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:34,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:34,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:34,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:34,128 INFO L87 Difference]: Start difference. First operand 5299 states and 15323 transitions. Second operand 3 states. [2019-12-27 18:30:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:34,194 INFO L93 Difference]: Finished difference Result 5310 states and 15338 transitions. [2019-12-27 18:30:34,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:34,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 18:30:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:34,202 INFO L225 Difference]: With dead ends: 5310 [2019-12-27 18:30:34,202 INFO L226 Difference]: Without dead ends: 5310 [2019-12-27 18:30:34,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-12-27 18:30:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 5303. [2019-12-27 18:30:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-12-27 18:30:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 15329 transitions. [2019-12-27 18:30:34,272 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 15329 transitions. Word has length 64 [2019-12-27 18:30:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:34,273 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 15329 transitions. [2019-12-27 18:30:34,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 15329 transitions. [2019-12-27 18:30:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:30:34,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:34,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:34,280 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:34,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:34,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1883123384, now seen corresponding path program 1 times [2019-12-27 18:30:34,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:34,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028092531] [2019-12-27 18:30:34,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:34,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028092531] [2019-12-27 18:30:34,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:34,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:30:34,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099054713] [2019-12-27 18:30:34,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:34,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:34,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 250 transitions. [2019-12-27 18:30:34,479 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:34,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:34,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:34,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:34,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:34,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:34,481 INFO L87 Difference]: Start difference. First operand 5303 states and 15329 transitions. Second operand 3 states. [2019-12-27 18:30:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:34,543 INFO L93 Difference]: Finished difference Result 5310 states and 15331 transitions. [2019-12-27 18:30:34,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:34,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 18:30:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:34,552 INFO L225 Difference]: With dead ends: 5310 [2019-12-27 18:30:34,552 INFO L226 Difference]: Without dead ends: 5309 [2019-12-27 18:30:34,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-12-27 18:30:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5304. [2019-12-27 18:30:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5304 states. [2019-12-27 18:30:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 15325 transitions. [2019-12-27 18:30:34,627 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 15325 transitions. Word has length 64 [2019-12-27 18:30:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:34,628 INFO L462 AbstractCegarLoop]: Abstraction has 5304 states and 15325 transitions. [2019-12-27 18:30:34,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 15325 transitions. [2019-12-27 18:30:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 18:30:34,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:34,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:34,635 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:34,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1883571210, now seen corresponding path program 1 times [2019-12-27 18:30:34,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:34,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063390259] [2019-12-27 18:30:34,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:34,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063390259] [2019-12-27 18:30:34,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:34,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:30:34,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32215476] [2019-12-27 18:30:34,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:34,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:34,864 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 250 transitions. [2019-12-27 18:30:34,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:34,865 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:34,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:34,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:34,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:34,866 INFO L87 Difference]: Start difference. First operand 5304 states and 15325 transitions. Second operand 3 states. [2019-12-27 18:30:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:34,890 INFO L93 Difference]: Finished difference Result 5018 states and 14292 transitions. [2019-12-27 18:30:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:34,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 18:30:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:34,895 INFO L225 Difference]: With dead ends: 5018 [2019-12-27 18:30:34,896 INFO L226 Difference]: Without dead ends: 5018 [2019-12-27 18:30:34,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2019-12-27 18:30:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 5018. [2019-12-27 18:30:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5018 states. [2019-12-27 18:30:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 14292 transitions. [2019-12-27 18:30:34,960 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 14292 transitions. Word has length 64 [2019-12-27 18:30:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:34,960 INFO L462 AbstractCegarLoop]: Abstraction has 5018 states and 14292 transitions. [2019-12-27 18:30:34,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 14292 transitions. [2019-12-27 18:30:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:30:34,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:34,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:34,970 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:34,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1128424098, now seen corresponding path program 1 times [2019-12-27 18:30:34,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:34,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716165723] [2019-12-27 18:30:34,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:35,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716165723] [2019-12-27 18:30:35,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:35,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:30:35,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734770954] [2019-12-27 18:30:35,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:35,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:35,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 251 transitions. [2019-12-27 18:30:35,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:35,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:30:35,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:30:35,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:35,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:30:35,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:30:35,390 INFO L87 Difference]: Start difference. First operand 5018 states and 14292 transitions. Second operand 5 states. [2019-12-27 18:30:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:35,674 INFO L93 Difference]: Finished difference Result 7370 states and 20822 transitions. [2019-12-27 18:30:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:30:35,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 18:30:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:35,685 INFO L225 Difference]: With dead ends: 7370 [2019-12-27 18:30:35,686 INFO L226 Difference]: Without dead ends: 7370 [2019-12-27 18:30:35,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:30:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7370 states. [2019-12-27 18:30:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7370 to 5949. [2019-12-27 18:30:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5949 states. [2019-12-27 18:30:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5949 states to 5949 states and 16974 transitions. [2019-12-27 18:30:35,775 INFO L78 Accepts]: Start accepts. Automaton has 5949 states and 16974 transitions. Word has length 65 [2019-12-27 18:30:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:35,776 INFO L462 AbstractCegarLoop]: Abstraction has 5949 states and 16974 transitions. [2019-12-27 18:30:35,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:30:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5949 states and 16974 transitions. [2019-12-27 18:30:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:30:35,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:35,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:35,784 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1275573794, now seen corresponding path program 2 times [2019-12-27 18:30:35,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:35,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89870284] [2019-12-27 18:30:35,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:35,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89870284] [2019-12-27 18:30:35,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:35,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:30:35,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [36472914] [2019-12-27 18:30:35,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:35,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:36,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 405 transitions. [2019-12-27 18:30:36,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:36,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:30:36,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:30:36,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:36,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:30:36,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:36,097 INFO L87 Difference]: Start difference. First operand 5949 states and 16974 transitions. Second operand 3 states. [2019-12-27 18:30:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:36,154 INFO L93 Difference]: Finished difference Result 5949 states and 16973 transitions. [2019-12-27 18:30:36,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:36,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:30:36,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:36,163 INFO L225 Difference]: With dead ends: 5949 [2019-12-27 18:30:36,164 INFO L226 Difference]: Without dead ends: 5949 [2019-12-27 18:30:36,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:30:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2019-12-27 18:30:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3768. [2019-12-27 18:30:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3768 states. [2019-12-27 18:30:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 10936 transitions. [2019-12-27 18:30:36,231 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 10936 transitions. Word has length 65 [2019-12-27 18:30:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:36,232 INFO L462 AbstractCegarLoop]: Abstraction has 3768 states and 10936 transitions. [2019-12-27 18:30:36,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:30:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 10936 transitions. [2019-12-27 18:30:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:30:36,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:36,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:36,237 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:36,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1444653798, now seen corresponding path program 1 times [2019-12-27 18:30:36,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:36,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796000485] [2019-12-27 18:30:36,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:36,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796000485] [2019-12-27 18:30:36,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:36,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:30:36,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [349275134] [2019-12-27 18:30:36,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:36,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:36,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 252 transitions. [2019-12-27 18:30:36,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:36,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:30:36,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:30:36,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:36,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:30:36,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:30:36,460 INFO L87 Difference]: Start difference. First operand 3768 states and 10936 transitions. Second operand 4 states. [2019-12-27 18:30:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:36,501 INFO L93 Difference]: Finished difference Result 3557 states and 10070 transitions. [2019-12-27 18:30:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:30:36,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 18:30:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:36,506 INFO L225 Difference]: With dead ends: 3557 [2019-12-27 18:30:36,506 INFO L226 Difference]: Without dead ends: 3557 [2019-12-27 18:30:36,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:30:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2019-12-27 18:30:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3181. [2019-12-27 18:30:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-12-27 18:30:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 9006 transitions. [2019-12-27 18:30:36,579 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 9006 transitions. Word has length 66 [2019-12-27 18:30:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:36,579 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 9006 transitions. [2019-12-27 18:30:36,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:30:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 9006 transitions. [2019-12-27 18:30:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:30:36,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:36,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:36,586 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:36,587 INFO L82 PathProgramCache]: Analyzing trace with hash -864116617, now seen corresponding path program 1 times [2019-12-27 18:30:36,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:36,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596822994] [2019-12-27 18:30:36,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:30:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:30:36,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596822994] [2019-12-27 18:30:36,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:30:36,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:30:36,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252424104] [2019-12-27 18:30:36,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:30:36,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:30:37,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 213 transitions. [2019-12-27 18:30:37,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:30:37,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:30:37,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:30:37,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:30:37,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:30:37,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:30:37,054 INFO L87 Difference]: Start difference. First operand 3181 states and 9006 transitions. Second operand 8 states. [2019-12-27 18:30:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:30:37,207 INFO L93 Difference]: Finished difference Result 6125 states and 17332 transitions. [2019-12-27 18:30:37,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:30:37,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-27 18:30:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:30:37,213 INFO L225 Difference]: With dead ends: 6125 [2019-12-27 18:30:37,213 INFO L226 Difference]: Without dead ends: 3103 [2019-12-27 18:30:37,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:30:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2019-12-27 18:30:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 2605. [2019-12-27 18:30:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-12-27 18:30:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 7305 transitions. [2019-12-27 18:30:37,258 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 7305 transitions. Word has length 67 [2019-12-27 18:30:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:30:37,258 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 7305 transitions. [2019-12-27 18:30:37,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:30:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 7305 transitions. [2019-12-27 18:30:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:30:37,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:30:37,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:30:37,262 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:30:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:30:37,262 INFO L82 PathProgramCache]: Analyzing trace with hash -492073483, now seen corresponding path program 2 times [2019-12-27 18:30:37,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:30:37,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175009903] [2019-12-27 18:30:37,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:30:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:30:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:30:37,414 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:30:37,414 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:30:37,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x$r_buff1_thd3~0_146) (= 0 |v_ULTIMATE.start_main_~#t2284~0.offset_18|) (= v_~z~0_13 0) (= v_~main$tmp_guard0~0_18 0) (= v_~y~0_84 0) (= v_~x$flush_delayed~0_40 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2284~0.base_24| 4)) (= v_~main$tmp_guard1~0_48 0) (= v_~__unbuffered_cnt~0_158 0) (= |v_#NULL.offset_3| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2284~0.base_24|) (= 0 v_~x$w_buff1_used~0_339) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff0_used~0_698) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_178) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2284~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2284~0.base_24|) |v_ULTIMATE.start_main_~#t2284~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~x$r_buff1_thd2~0_152) (= v_~x$r_buff0_thd1~0_141 0) (= v_~x$mem_tmp~0_20 0) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t2284~0.base_24| 1)) (= 0 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p2_EBX~0_42 0) (= v_~x$r_buff1_thd0~0_256 0) (= 0 v_~x$w_buff1~0_143) (= 0 |v_#NULL.base_3|) (= 0 v_~x$w_buff0~0_158) (= (select .cse0 |v_ULTIMATE.start_main_~#t2284~0.base_24|) 0) (= v_~x$r_buff0_thd0~0_367 0) (= 0 v_~weak$$choice2~0_95) (= 0 v_~x$r_buff0_thd2~0_210) (= 0 v_~x$r_buff0_thd3~0_129) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_16|, ~x$w_buff0~0=v_~x$w_buff0~0_158, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_38|, ULTIMATE.start_main_~#t2286~0.base=|v_ULTIMATE.start_main_~#t2286~0.base_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_40, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_26|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_30|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_62|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_129, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_71|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ULTIMATE.start_main_~#t2284~0.offset=|v_ULTIMATE.start_main_~#t2284~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_367, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_26|, ~x$w_buff1~0=v_~x$w_buff1~0_143, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_339, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_152, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_147|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, ~x~0=v_~x~0_178, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_16|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_24|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_28|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_31|, ~x$mem_tmp~0=v_~x$mem_tmp~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_254|, ULTIMATE.start_main_~#t2285~0.offset=|v_ULTIMATE.start_main_~#t2285~0.offset_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~y~0=v_~y~0_84, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_16|, ULTIMATE.start_main_~#t2284~0.base=|v_ULTIMATE.start_main_~#t2284~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_22|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_256, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_210, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_698, ULTIMATE.start_main_~#t2285~0.base=|v_ULTIMATE.start_main_~#t2285~0.base_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_147|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_95, ULTIMATE.start_main_~#t2286~0.offset=|v_ULTIMATE.start_main_~#t2286~0.offset_15|, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2286~0.base, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2284~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2285~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2284~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2285~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2286~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:30:37,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L807-1-->L809: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2285~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2285~0.base_11|) |v_ULTIMATE.start_main_~#t2285~0.offset_9| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2285~0.base_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2285~0.base_11| 4)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2285~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2285~0.offset_9|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2285~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2285~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2285~0.base=|v_ULTIMATE.start_main_~#t2285~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_3|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2285~0.offset=|v_ULTIMATE.start_main_~#t2285~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2285~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2285~0.offset] because there is no mapped edge [2019-12-27 18:30:37,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L809-1-->L811: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2286~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2286~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2286~0.base_11|) |v_ULTIMATE.start_main_~#t2286~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2286~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2286~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2286~0.base_11| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2286~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2286~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2286~0.base=|v_ULTIMATE.start_main_~#t2286~0.base_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2286~0.offset=|v_ULTIMATE.start_main_~#t2286~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2286~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2286~0.offset] because there is no mapped edge [2019-12-27 18:30:37,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L4-->L764: Formula: (and (= 1 ~y~0_Out60598353) (= ~x$r_buff0_thd2~0_In60598353 ~x$r_buff1_thd2~0_Out60598353) (= ~x$r_buff0_thd0~0_In60598353 ~x$r_buff1_thd0~0_Out60598353) (= 1 ~x$r_buff0_thd2~0_Out60598353) (= ~x$r_buff1_thd1~0_Out60598353 ~x$r_buff0_thd1~0_In60598353) (= ~x$r_buff0_thd3~0_In60598353 ~x$r_buff1_thd3~0_Out60598353) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In60598353))) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In60598353, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In60598353, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In60598353, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In60598353, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In60598353} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In60598353, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In60598353, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In60598353, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out60598353, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out60598353, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out60598353, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In60598353, ~y~0=~y~0_Out60598353, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out60598353, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out60598353} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:30:37,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L784-2-->L784-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-551707057 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-551707057 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-551707057| ~x$w_buff1~0_In-551707057)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-551707057| ~x~0_In-551707057)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-551707057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-551707057, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-551707057, ~x~0=~x~0_In-551707057} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-551707057|, ~x$w_buff1~0=~x$w_buff1~0_In-551707057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-551707057, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-551707057, ~x~0=~x~0_In-551707057} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:30:37,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L784-4-->L785: Formula: (= v_~x~0_27 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 18:30:37,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-62718061 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-62718061 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-62718061|)) (and (= ~x$w_buff0_used~0_In-62718061 |P2Thread1of1ForFork2_#t~ite17_Out-62718061|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-62718061, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-62718061} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-62718061, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-62718061|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-62718061} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:30:37,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-91662603 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-91662603 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-91662603 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-91662603 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-91662603|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-91662603 |P2Thread1of1ForFork2_#t~ite18_Out-91662603|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-91662603, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-91662603, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-91662603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-91662603} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-91662603, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-91662603, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-91662603, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-91662603|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-91662603} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:30:37,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L735-2-->L735-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In367042798 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In367042798 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In367042798 |P0Thread1of1ForFork0_#t~ite3_Out367042798|) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out367042798| ~x~0_In367042798)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In367042798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In367042798, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In367042798, ~x~0=~x~0_In367042798} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out367042798|, ~x$w_buff1~0=~x$w_buff1~0_In367042798, ~x$w_buff1_used~0=~x$w_buff1_used~0_In367042798, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In367042798, ~x~0=~x~0_In367042798} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 18:30:37,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L735-4-->L736: Formula: (= v_~x~0_31 |v_P0Thread1of1ForFork0_#t~ite3_10|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_10|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_9|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_13|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 18:30:37,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In41740920 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In41740920 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out41740920| ~x$w_buff0_used~0_In41740920) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out41740920|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In41740920, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41740920} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out41740920|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In41740920, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41740920} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:30:37,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1294730195 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1294730195 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1294730195 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1294730195 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1294730195|)) (and (= ~x$w_buff1_used~0_In-1294730195 |P0Thread1of1ForFork0_#t~ite6_Out-1294730195|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1294730195, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294730195, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1294730195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294730195} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1294730195|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1294730195, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294730195, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1294730195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294730195} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:30:37,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In900388080 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In900388080 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out900388080|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In900388080 |P0Thread1of1ForFork0_#t~ite7_Out900388080|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In900388080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In900388080} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In900388080, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out900388080|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In900388080} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 18:30:37,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L739-->L739-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1869057116 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1869057116 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1869057116 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1869057116 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1869057116| ~x$r_buff1_thd1~0_In1869057116) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1869057116| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1869057116, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1869057116, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1869057116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1869057116} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1869057116, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1869057116|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1869057116, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1869057116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1869057116} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:30:37,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_101 |v_P0Thread1of1ForFork0_#t~ite8_62|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_62|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_61|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_101} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 18:30:37,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-769734109 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-769734109 256)))) (or (and (= ~x$w_buff0_used~0_In-769734109 |P1Thread1of1ForFork1_#t~ite11_Out-769734109|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-769734109| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-769734109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-769734109} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-769734109|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-769734109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-769734109} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:30:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-865532930 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-865532930 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-865532930 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-865532930 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-865532930| ~x$w_buff1_used~0_In-865532930) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-865532930| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-865532930, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-865532930, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-865532930, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865532930} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-865532930, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-865532930, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-865532930|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-865532930, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865532930} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:30:37,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L767-->L768: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-653481406 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-653481406 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-653481406 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-653481406 ~x$r_buff0_thd2~0_Out-653481406) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-653481406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-653481406} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-653481406|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-653481406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-653481406} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:30:37,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1518150712 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1518150712 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1518150712 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1518150712 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1518150712| ~x$r_buff1_thd2~0_In1518150712)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1518150712|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1518150712, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1518150712, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1518150712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1518150712} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1518150712, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1518150712, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1518150712, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1518150712|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1518150712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:30:37,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~x$r_buff1_thd2~0_54 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:30:37,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In939996803 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In939996803 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In939996803 |P2Thread1of1ForFork2_#t~ite19_Out939996803|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out939996803|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In939996803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In939996803} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In939996803, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out939996803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In939996803} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:30:37,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1982063002 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1982063002 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-1982063002 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1982063002 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1982063002|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1982063002| ~x$r_buff1_thd3~0_In-1982063002) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1982063002, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1982063002, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1982063002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1982063002} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1982063002|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1982063002, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1982063002, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1982063002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1982063002} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:30:37,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1)) (= v_~x$r_buff1_thd3~0_81 |v_P2Thread1of1ForFork2_#t~ite20_50|)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_49|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_81, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:30:37,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:30:37,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L817-2-->L817-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite24_Out1058100077| |ULTIMATE.start_main_#t~ite25_Out1058100077|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1058100077 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1058100077 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite24_Out1058100077| ~x$w_buff1~0_In1058100077) (not .cse1) (not .cse2)) (and .cse0 (= ~x~0_In1058100077 |ULTIMATE.start_main_#t~ite24_Out1058100077|) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1058100077, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1058100077, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1058100077, ~x~0=~x~0_In1058100077} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1058100077, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1058100077|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1058100077|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1058100077, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1058100077, ~x~0=~x~0_In1058100077} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 18:30:37,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1574038974 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1574038974 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1574038974| 0)) (and (= |ULTIMATE.start_main_#t~ite26_Out1574038974| ~x$w_buff0_used~0_In1574038974) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1574038974, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1574038974} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1574038974, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1574038974|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1574038974} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:30:37,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-82980679 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-82980679 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-82980679 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-82980679 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-82980679| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite27_Out-82980679| ~x$w_buff1_used~0_In-82980679) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-82980679, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-82980679, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-82980679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-82980679} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-82980679, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-82980679, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-82980679|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-82980679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-82980679} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:30:37,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1860564800 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1860564800 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out1860564800| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1860564800 |ULTIMATE.start_main_#t~ite28_Out1860564800|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1860564800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860564800} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1860564800, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1860564800|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860564800} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:30:37,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-306014163 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-306014163 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-306014163 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-306014163 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-306014163 |ULTIMATE.start_main_#t~ite29_Out-306014163|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-306014163|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-306014163, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-306014163, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-306014163, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-306014163} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-306014163, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-306014163|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-306014163, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-306014163, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-306014163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:30:37,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L832-->L832-8: Formula: (let ((.cse4 (= (mod ~x$r_buff1_thd0~0_In1222242023 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1222242023 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In1222242023 256))) (.cse5 (= |ULTIMATE.start_main_#t~ite45_Out1222242023| |ULTIMATE.start_main_#t~ite44_Out1222242023|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1222242023 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1222242023 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_In1222242023| |ULTIMATE.start_main_#t~ite43_Out1222242023|) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_In1222242023| |ULTIMATE.start_main_#t~ite44_Out1222242023|) (= |ULTIMATE.start_main_#t~ite45_Out1222242023| ~x$w_buff1_used~0_In1222242023)) (and .cse0 (= ~x$w_buff1_used~0_In1222242023 |ULTIMATE.start_main_#t~ite44_Out1222242023|) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3)) .cse5))) (let ((.cse6 (not .cse3))) (and (= |ULTIMATE.start_main_#t~ite43_Out1222242023| |ULTIMATE.start_main_#t~ite44_Out1222242023|) (or .cse6 (not .cse4)) (not .cse1) .cse0 (= 0 |ULTIMATE.start_main_#t~ite43_Out1222242023|) .cse5 (or .cse6 (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1222242023, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1222242023, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1222242023, ~weak$$choice2~0=~weak$$choice2~0_In1222242023, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In1222242023|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1222242023, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In1222242023|} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1222242023, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1222242023, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1222242023, ~weak$$choice2~0=~weak$$choice2~0_In1222242023, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1222242023|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1222242023|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1222242023|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1222242023} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:30:37,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-8-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_91 256) 0)) (= v_~x$w_buff1_used~0_335 |v_ULTIMATE.start_main_#t~ite45_32|) (= v_~x$r_buff0_thd0~0_362 v_~x$r_buff0_thd0~0_361)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ~weak$$choice2~0=v_~weak$$choice2~0_91, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_361, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_26|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_26|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_335, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_27|, ~weak$$choice2~0=v_~weak$$choice2~0_91, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_30|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_30|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:30:37,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In720757199 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In720757199 |ULTIMATE.start_main_#t~ite50_Out720757199|) (= |ULTIMATE.start_main_#t~ite51_Out720757199| |ULTIMATE.start_main_#t~ite50_Out720757199|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In720757199 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In720757199 256)) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In720757199 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In720757199 256)))))) (and (= |ULTIMATE.start_main_#t~ite50_In720757199| |ULTIMATE.start_main_#t~ite50_Out720757199|) (= ~x$r_buff1_thd0~0_In720757199 |ULTIMATE.start_main_#t~ite51_Out720757199|) (not .cse0)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In720757199|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In720757199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In720757199, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In720757199, ~weak$$choice2~0=~weak$$choice2~0_In720757199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In720757199} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out720757199|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In720757199, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out720757199|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In720757199, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In720757199, ~weak$$choice2~0=~weak$$choice2~0_In720757199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In720757199} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 18:30:37,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L836-->L839-1: Formula: (and (= v_~x$mem_tmp~0_12 v_~x~0_148) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$flush_delayed~0_22 0) (= (mod v_~main$tmp_guard1~0_34 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~x$mem_tmp~0=v_~x$mem_tmp~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ~x~0=v_~x~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:30:37,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L839-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:30:37,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:30:37 BasicIcfg [2019-12-27 18:30:37,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:30:37,560 INFO L168 Benchmark]: Toolchain (without parser) took 96846.15 ms. Allocated memory was 141.6 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 97.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 578.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:30:37,561 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 18:30:37,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 847.33 ms. Allocated memory was 141.6 MB in the beginning and 198.7 MB in the end (delta: 57.1 MB). Free memory was 97.5 MB in the beginning and 152.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:30:37,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.78 ms. Allocated memory is still 198.7 MB. Free memory was 152.4 MB in the beginning and 148.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:30:37,563 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 198.7 MB. Free memory was 148.9 MB in the beginning and 146.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:30:37,563 INFO L168 Benchmark]: RCFGBuilder took 857.22 ms. Allocated memory is still 198.7 MB. Free memory was 146.8 MB in the beginning and 96.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:30:37,564 INFO L168 Benchmark]: TraceAbstraction took 95015.11 ms. Allocated memory was 198.7 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 96.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 519.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:30:37,573 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.23 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 847.33 ms. Allocated memory was 141.6 MB in the beginning and 198.7 MB in the end (delta: 57.1 MB). Free memory was 97.5 MB in the beginning and 152.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.78 ms. Allocated memory is still 198.7 MB. Free memory was 152.4 MB in the beginning and 148.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 198.7 MB. Free memory was 148.9 MB in the beginning and 146.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.22 ms. Allocated memory is still 198.7 MB. Free memory was 146.8 MB in the beginning and 96.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95015.11 ms. Allocated memory was 198.7 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 96.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 519.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 175 ProgramPointsBefore, 94 ProgramPointsAfterwards, 212 TransitionsBefore, 103 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 32 ChoiceCompositions, 5784 VarBasedMoverChecksPositive, 205 VarBasedMoverChecksNegative, 38 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 91392 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 2 x$w_buff1 = x$w_buff0 [L750] 2 x$w_buff0 = 2 [L751] 2 x$w_buff1_used = x$w_buff0_used [L752] 2 x$w_buff0_used = (_Bool)1 [L811] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L784] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L786] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L820] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 x$flush_delayed = weak$$choice2 [L827] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 94.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1952 SDtfs, 1733 SDslu, 2755 SDs, 0 SdLazy, 1286 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 16 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202025occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 67050 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 645 NumberOfCodeBlocks, 645 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 108984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...