/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:52:01,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:52:01,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:52:01,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:52:01,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:52:01,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:52:01,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:52:01,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:52:01,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:52:01,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:52:01,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:52:01,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:52:01,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:52:01,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:52:01,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:52:01,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:52:01,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:52:01,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:52:01,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:52:01,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:52:01,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:52:01,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:52:01,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:52:01,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:52:01,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:52:01,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:52:01,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:52:01,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:52:01,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:52:01,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:52:01,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:52:01,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:52:01,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:52:01,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:52:01,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:52:01,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:52:01,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:52:01,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:52:01,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:52:01,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:52:01,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:52:01,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:52:01,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:52:01,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:52:01,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:52:01,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:52:01,525 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:52:01,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:52:01,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:52:01,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:52:01,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:52:01,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:52:01,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:52:01,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:52:01,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:52:01,527 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:52:01,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:52:01,527 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:52:01,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:52:01,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:52:01,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:52:01,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:52:01,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:52:01,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:52:01,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:52:01,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:52:01,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:52:01,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:52:01,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:52:01,530 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:52:01,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:52:01,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:52:01,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:52:01,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:52:01,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:52:01,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:52:01,827 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:52:01,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i [2019-12-18 20:52:01,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b014db6e/58ededf85a064db7929d1c58cb9bbdc9/FLAG34a609d24 [2019-12-18 20:52:02,488 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:52:02,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i [2019-12-18 20:52:02,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b014db6e/58ededf85a064db7929d1c58cb9bbdc9/FLAG34a609d24 [2019-12-18 20:52:02,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b014db6e/58ededf85a064db7929d1c58cb9bbdc9 [2019-12-18 20:52:02,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:52:02,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:52:02,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:52:02,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:52:02,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:52:02,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:52:02" (1/1) ... [2019-12-18 20:52:02,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e603f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:02, skipping insertion in model container [2019-12-18 20:52:02,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:52:02" (1/1) ... [2019-12-18 20:52:02,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:52:02,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:52:03,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:52:03,329 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:52:03,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:52:03,526 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:52:03,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03 WrapperNode [2019-12-18 20:52:03,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:52:03,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:52:03,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:52:03,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:52:03,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... [2019-12-18 20:52:03,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... [2019-12-18 20:52:03,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:52:03,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:52:03,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:52:03,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:52:03,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... [2019-12-18 20:52:03,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... [2019-12-18 20:52:03,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... [2019-12-18 20:52:03,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... [2019-12-18 20:52:03,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... [2019-12-18 20:52:03,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... [2019-12-18 20:52:03,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... [2019-12-18 20:52:03,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:52:03,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:52:03,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:52:03,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:52:03,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:52:03,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:52:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:52:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:52:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:52:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:52:03,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:52:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:52:03,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:52:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:52:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:52:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:52:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:52:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:52:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:52:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:52:03,702 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:52:04,475 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:52:04,475 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:52:04,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:52:04 BoogieIcfgContainer [2019-12-18 20:52:04,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:52:04,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:52:04,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:52:04,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:52:04,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:52:02" (1/3) ... [2019-12-18 20:52:04,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566cbd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:52:04, skipping insertion in model container [2019-12-18 20:52:04,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:03" (2/3) ... [2019-12-18 20:52:04,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566cbd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:52:04, skipping insertion in model container [2019-12-18 20:52:04,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:52:04" (3/3) ... [2019-12-18 20:52:04,486 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt.i [2019-12-18 20:52:04,496 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:52:04,497 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:52:04,505 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:52:04,506 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:52:04,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,598 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,598 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,598 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,599 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,599 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,605 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,605 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,615 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,616 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,625 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,628 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,631 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,632 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,632 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:52:04,648 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:52:04,669 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:52:04,670 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:52:04,670 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:52:04,670 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:52:04,670 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:52:04,670 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:52:04,670 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:52:04,671 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:52:04,699 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 20:52:04,701 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:52:04,807 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:52:04,807 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:52:04,826 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:52:04,854 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:52:04,909 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:52:04,909 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:52:04,917 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:52:04,939 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 20:52:04,940 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:52:08,707 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 20:52:08,859 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 20:52:08,882 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68785 [2019-12-18 20:52:08,882 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 20:52:08,886 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 94 transitions [2019-12-18 20:52:44,971 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171512 states. [2019-12-18 20:52:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 171512 states. [2019-12-18 20:52:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:52:44,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:52:44,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:52:44,980 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:52:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:52:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash 411952807, now seen corresponding path program 1 times [2019-12-18 20:52:44,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:52:44,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492709136] [2019-12-18 20:52:44,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:52:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:52:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:52:45,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492709136] [2019-12-18 20:52:45,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:52:45,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:52:45,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085148016] [2019-12-18 20:52:45,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:52:45,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:52:45,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:52:45,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:52:45,276 INFO L87 Difference]: Start difference. First operand 171512 states. Second operand 3 states. [2019-12-18 20:52:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:52:50,800 INFO L93 Difference]: Finished difference Result 168024 states and 799121 transitions. [2019-12-18 20:52:50,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:52:50,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:52:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:52:51,863 INFO L225 Difference]: With dead ends: 168024 [2019-12-18 20:52:51,863 INFO L226 Difference]: Without dead ends: 158222 [2019-12-18 20:52:51,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:53:00,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158222 states. [2019-12-18 20:53:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158222 to 158222. [2019-12-18 20:53:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158222 states. [2019-12-18 20:53:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158222 states to 158222 states and 751554 transitions. [2019-12-18 20:53:04,490 INFO L78 Accepts]: Start accepts. Automaton has 158222 states and 751554 transitions. Word has length 7 [2019-12-18 20:53:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:53:04,491 INFO L462 AbstractCegarLoop]: Abstraction has 158222 states and 751554 transitions. [2019-12-18 20:53:04,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:53:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 158222 states and 751554 transitions. [2019-12-18 20:53:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:53:04,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:53:04,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:53:04,502 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:53:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:53:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1837496969, now seen corresponding path program 1 times [2019-12-18 20:53:04,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:53:04,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425611660] [2019-12-18 20:53:04,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:53:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:53:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:53:09,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425611660] [2019-12-18 20:53:09,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:53:09,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:53:09,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59154335] [2019-12-18 20:53:09,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:53:09,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:53:09,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:53:09,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:53:09,939 INFO L87 Difference]: Start difference. First operand 158222 states and 751554 transitions. Second operand 4 states. [2019-12-18 20:53:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:53:12,170 INFO L93 Difference]: Finished difference Result 247350 states and 1127352 transitions. [2019-12-18 20:53:12,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:53:12,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:53:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:53:13,166 INFO L225 Difference]: With dead ends: 247350 [2019-12-18 20:53:13,167 INFO L226 Difference]: Without dead ends: 247168 [2019-12-18 20:53:13,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:53:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247168 states. [2019-12-18 20:53:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247168 to 227148. [2019-12-18 20:53:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227148 states. [2019-12-18 20:53:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227148 states to 227148 states and 1045761 transitions. [2019-12-18 20:53:38,873 INFO L78 Accepts]: Start accepts. Automaton has 227148 states and 1045761 transitions. Word has length 15 [2019-12-18 20:53:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:53:38,873 INFO L462 AbstractCegarLoop]: Abstraction has 227148 states and 1045761 transitions. [2019-12-18 20:53:38,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:53:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 227148 states and 1045761 transitions. [2019-12-18 20:53:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:53:38,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:53:38,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:53:38,878 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:53:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:53:38,879 INFO L82 PathProgramCache]: Analyzing trace with hash -372809848, now seen corresponding path program 1 times [2019-12-18 20:53:38,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:53:38,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548934536] [2019-12-18 20:53:38,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:53:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:53:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:53:38,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548934536] [2019-12-18 20:53:38,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:53:38,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:53:38,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860430680] [2019-12-18 20:53:38,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:53:38,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:53:38,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:53:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:53:38,970 INFO L87 Difference]: Start difference. First operand 227148 states and 1045761 transitions. Second operand 3 states. [2019-12-18 20:53:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:53:41,528 INFO L93 Difference]: Finished difference Result 141425 states and 586615 transitions. [2019-12-18 20:53:41,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:53:41,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 20:53:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:53:42,011 INFO L225 Difference]: With dead ends: 141425 [2019-12-18 20:53:42,011 INFO L226 Difference]: Without dead ends: 141425 [2019-12-18 20:53:42,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:53:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141425 states. [2019-12-18 20:53:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141425 to 141425. [2019-12-18 20:53:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141425 states. [2019-12-18 20:53:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141425 states to 141425 states and 586615 transitions. [2019-12-18 20:53:56,520 INFO L78 Accepts]: Start accepts. Automaton has 141425 states and 586615 transitions. Word has length 15 [2019-12-18 20:53:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:53:56,520 INFO L462 AbstractCegarLoop]: Abstraction has 141425 states and 586615 transitions. [2019-12-18 20:53:56,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:53:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 141425 states and 586615 transitions. [2019-12-18 20:53:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:53:56,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:53:56,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:53:56,526 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:53:56,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:53:56,527 INFO L82 PathProgramCache]: Analyzing trace with hash -728396216, now seen corresponding path program 1 times [2019-12-18 20:53:56,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:53:56,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964942433] [2019-12-18 20:53:56,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:53:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:53:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:53:56,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964942433] [2019-12-18 20:53:56,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:53:56,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:53:56,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063846857] [2019-12-18 20:53:56,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:53:56,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:53:56,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:53:56,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:53:56,598 INFO L87 Difference]: Start difference. First operand 141425 states and 586615 transitions. Second operand 4 states. [2019-12-18 20:53:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:53:56,783 INFO L93 Difference]: Finished difference Result 38183 states and 134511 transitions. [2019-12-18 20:53:56,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:53:56,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:53:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:53:56,885 INFO L225 Difference]: With dead ends: 38183 [2019-12-18 20:53:56,885 INFO L226 Difference]: Without dead ends: 38183 [2019-12-18 20:53:56,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:53:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38183 states. [2019-12-18 20:53:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38183 to 38183. [2019-12-18 20:53:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38183 states. [2019-12-18 20:54:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38183 states to 38183 states and 134511 transitions. [2019-12-18 20:54:02,672 INFO L78 Accepts]: Start accepts. Automaton has 38183 states and 134511 transitions. Word has length 16 [2019-12-18 20:54:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:02,672 INFO L462 AbstractCegarLoop]: Abstraction has 38183 states and 134511 transitions. [2019-12-18 20:54:02,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:54:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 38183 states and 134511 transitions. [2019-12-18 20:54:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:54:02,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:02,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:54:02,675 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:02,675 INFO L82 PathProgramCache]: Analyzing trace with hash 539668976, now seen corresponding path program 1 times [2019-12-18 20:54:02,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:02,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808906408] [2019-12-18 20:54:02,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:02,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808906408] [2019-12-18 20:54:02,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:02,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:54:02,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508919217] [2019-12-18 20:54:02,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:54:02,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:02,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:54:02,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:02,771 INFO L87 Difference]: Start difference. First operand 38183 states and 134511 transitions. Second operand 5 states. [2019-12-18 20:54:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:03,348 INFO L93 Difference]: Finished difference Result 53681 states and 185843 transitions. [2019-12-18 20:54:03,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:54:03,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 20:54:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:03,454 INFO L225 Difference]: With dead ends: 53681 [2019-12-18 20:54:03,454 INFO L226 Difference]: Without dead ends: 53665 [2019-12-18 20:54:03,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53665 states. [2019-12-18 20:54:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53665 to 41924. [2019-12-18 20:54:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41924 states. [2019-12-18 20:54:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41924 states to 41924 states and 147192 transitions. [2019-12-18 20:54:04,266 INFO L78 Accepts]: Start accepts. Automaton has 41924 states and 147192 transitions. Word has length 16 [2019-12-18 20:54:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:04,267 INFO L462 AbstractCegarLoop]: Abstraction has 41924 states and 147192 transitions. [2019-12-18 20:54:04,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:54:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 41924 states and 147192 transitions. [2019-12-18 20:54:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:54:04,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:04,283 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] [2019-12-18 20:54:04,283 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:04,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1532269358, now seen corresponding path program 1 times [2019-12-18 20:54:04,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:04,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496805530] [2019-12-18 20:54:04,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:04,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496805530] [2019-12-18 20:54:04,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:04,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:54:04,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253052290] [2019-12-18 20:54:04,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:54:04,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:04,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:54:04,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:54:04,384 INFO L87 Difference]: Start difference. First operand 41924 states and 147192 transitions. Second operand 6 states. [2019-12-18 20:54:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:05,745 INFO L93 Difference]: Finished difference Result 63881 states and 218393 transitions. [2019-12-18 20:54:05,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:54:05,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 20:54:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:05,872 INFO L225 Difference]: With dead ends: 63881 [2019-12-18 20:54:05,873 INFO L226 Difference]: Without dead ends: 63853 [2019-12-18 20:54:05,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:54:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63853 states. [2019-12-18 20:54:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63853 to 43646. [2019-12-18 20:54:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43646 states. [2019-12-18 20:54:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43646 states to 43646 states and 152050 transitions. [2019-12-18 20:54:07,405 INFO L78 Accepts]: Start accepts. Automaton has 43646 states and 152050 transitions. Word has length 24 [2019-12-18 20:54:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:07,406 INFO L462 AbstractCegarLoop]: Abstraction has 43646 states and 152050 transitions. [2019-12-18 20:54:07,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:54:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 43646 states and 152050 transitions. [2019-12-18 20:54:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:54:07,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:07,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:54:07,427 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1695567288, now seen corresponding path program 1 times [2019-12-18 20:54:07,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:07,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276270322] [2019-12-18 20:54:07,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:07,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276270322] [2019-12-18 20:54:07,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:07,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:54:07,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402601601] [2019-12-18 20:54:07,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:54:07,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:07,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:54:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:07,519 INFO L87 Difference]: Start difference. First operand 43646 states and 152050 transitions. Second operand 5 states. [2019-12-18 20:54:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:07,631 INFO L93 Difference]: Finished difference Result 22336 states and 78762 transitions. [2019-12-18 20:54:07,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:54:07,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:54:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:07,671 INFO L225 Difference]: With dead ends: 22336 [2019-12-18 20:54:07,672 INFO L226 Difference]: Without dead ends: 22336 [2019-12-18 20:54:07,672 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-18 20:54:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22336 states. [2019-12-18 20:54:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22336 to 22144. [2019-12-18 20:54:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22144 states. [2019-12-18 20:54:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22144 states to 22144 states and 78106 transitions. [2019-12-18 20:54:08,031 INFO L78 Accepts]: Start accepts. Automaton has 22144 states and 78106 transitions. Word has length 28 [2019-12-18 20:54:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:08,031 INFO L462 AbstractCegarLoop]: Abstraction has 22144 states and 78106 transitions. [2019-12-18 20:54:08,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:54:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 22144 states and 78106 transitions. [2019-12-18 20:54:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:54:08,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:08,069 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] [2019-12-18 20:54:08,070 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:08,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1310501217, now seen corresponding path program 1 times [2019-12-18 20:54:08,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:08,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727576349] [2019-12-18 20:54:08,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:08,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727576349] [2019-12-18 20:54:08,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:08,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:54:08,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509429412] [2019-12-18 20:54:08,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:54:08,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:54:08,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:54:08,166 INFO L87 Difference]: Start difference. First operand 22144 states and 78106 transitions. Second operand 4 states. [2019-12-18 20:54:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:08,308 INFO L93 Difference]: Finished difference Result 32187 states and 108348 transitions. [2019-12-18 20:54:08,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:54:08,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 20:54:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:08,353 INFO L225 Difference]: With dead ends: 32187 [2019-12-18 20:54:08,353 INFO L226 Difference]: Without dead ends: 22530 [2019-12-18 20:54:08,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2019-12-18 20:54:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 22434. [2019-12-18 20:54:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22434 states. [2019-12-18 20:54:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22434 states to 22434 states and 78130 transitions. [2019-12-18 20:54:08,711 INFO L78 Accepts]: Start accepts. Automaton has 22434 states and 78130 transitions. Word has length 42 [2019-12-18 20:54:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:08,711 INFO L462 AbstractCegarLoop]: Abstraction has 22434 states and 78130 transitions. [2019-12-18 20:54:08,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:54:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 22434 states and 78130 transitions. [2019-12-18 20:54:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:54:08,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:08,748 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] [2019-12-18 20:54:08,749 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash 475291737, now seen corresponding path program 2 times [2019-12-18 20:54:08,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:08,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631784345] [2019-12-18 20:54:08,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:08,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631784345] [2019-12-18 20:54:08,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:08,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:54:08,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885164722] [2019-12-18 20:54:08,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:54:08,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:08,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:54:08,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:08,845 INFO L87 Difference]: Start difference. First operand 22434 states and 78130 transitions. Second operand 5 states. [2019-12-18 20:54:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:09,708 INFO L93 Difference]: Finished difference Result 34019 states and 117486 transitions. [2019-12-18 20:54:09,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:54:09,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 20:54:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:09,771 INFO L225 Difference]: With dead ends: 34019 [2019-12-18 20:54:09,772 INFO L226 Difference]: Without dead ends: 34019 [2019-12-18 20:54:09,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34019 states. [2019-12-18 20:54:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34019 to 26693. [2019-12-18 20:54:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26693 states. [2019-12-18 20:54:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26693 states to 26693 states and 93064 transitions. [2019-12-18 20:54:10,270 INFO L78 Accepts]: Start accepts. Automaton has 26693 states and 93064 transitions. Word has length 42 [2019-12-18 20:54:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:10,270 INFO L462 AbstractCegarLoop]: Abstraction has 26693 states and 93064 transitions. [2019-12-18 20:54:10,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:54:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 26693 states and 93064 transitions. [2019-12-18 20:54:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:54:10,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:10,304 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] [2019-12-18 20:54:10,304 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1445286149, now seen corresponding path program 3 times [2019-12-18 20:54:10,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:10,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382349728] [2019-12-18 20:54:10,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:10,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382349728] [2019-12-18 20:54:10,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:10,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:54:10,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476568908] [2019-12-18 20:54:10,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:54:10,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:10,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:54:10,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:54:10,378 INFO L87 Difference]: Start difference. First operand 26693 states and 93064 transitions. Second operand 6 states. [2019-12-18 20:54:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:10,515 INFO L93 Difference]: Finished difference Result 25272 states and 89500 transitions. [2019-12-18 20:54:10,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:54:10,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 20:54:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:10,559 INFO L225 Difference]: With dead ends: 25272 [2019-12-18 20:54:10,559 INFO L226 Difference]: Without dead ends: 23431 [2019-12-18 20:54:10,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-18 20:54:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23431 states. [2019-12-18 20:54:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23431 to 22547. [2019-12-18 20:54:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22547 states. [2019-12-18 20:54:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22547 states to 22547 states and 80021 transitions. [2019-12-18 20:54:10,953 INFO L78 Accepts]: Start accepts. Automaton has 22547 states and 80021 transitions. Word has length 42 [2019-12-18 20:54:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:10,953 INFO L462 AbstractCegarLoop]: Abstraction has 22547 states and 80021 transitions. [2019-12-18 20:54:10,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:54:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 22547 states and 80021 transitions. [2019-12-18 20:54:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:10,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:10,988 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] [2019-12-18 20:54:10,989 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1547062622, now seen corresponding path program 1 times [2019-12-18 20:54:10,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:10,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478758847] [2019-12-18 20:54:10,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:11,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478758847] [2019-12-18 20:54:11,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:11,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:54:11,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925398270] [2019-12-18 20:54:11,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:54:11,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:11,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:54:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:11,037 INFO L87 Difference]: Start difference. First operand 22547 states and 80021 transitions. Second operand 3 states. [2019-12-18 20:54:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:11,428 INFO L93 Difference]: Finished difference Result 31881 states and 113184 transitions. [2019-12-18 20:54:11,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:54:11,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:54:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:11,522 INFO L225 Difference]: With dead ends: 31881 [2019-12-18 20:54:11,523 INFO L226 Difference]: Without dead ends: 31881 [2019-12-18 20:54:11,523 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-18 20:54:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31881 states. [2019-12-18 20:54:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31881 to 26551. [2019-12-18 20:54:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26551 states. [2019-12-18 20:54:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26551 states to 26551 states and 94982 transitions. [2019-12-18 20:54:12,068 INFO L78 Accepts]: Start accepts. Automaton has 26551 states and 94982 transitions. Word has length 57 [2019-12-18 20:54:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:12,068 INFO L462 AbstractCegarLoop]: Abstraction has 26551 states and 94982 transitions. [2019-12-18 20:54:12,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:54:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26551 states and 94982 transitions. [2019-12-18 20:54:12,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:12,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:12,118 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] [2019-12-18 20:54:12,119 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:12,119 INFO L82 PathProgramCache]: Analyzing trace with hash -990317698, now seen corresponding path program 1 times [2019-12-18 20:54:12,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:12,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993400402] [2019-12-18 20:54:12,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:12,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993400402] [2019-12-18 20:54:12,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:12,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:54:12,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692652005] [2019-12-18 20:54:12,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:54:12,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:54:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:54:12,190 INFO L87 Difference]: Start difference. First operand 26551 states and 94982 transitions. Second operand 4 states. [2019-12-18 20:54:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:12,392 INFO L93 Difference]: Finished difference Result 38479 states and 132146 transitions. [2019-12-18 20:54:12,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:54:12,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 20:54:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:12,418 INFO L225 Difference]: With dead ends: 38479 [2019-12-18 20:54:12,418 INFO L226 Difference]: Without dead ends: 12719 [2019-12-18 20:54:12,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:54:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12719 states. [2019-12-18 20:54:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12719 to 12719. [2019-12-18 20:54:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12719 states. [2019-12-18 20:54:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12719 states to 12719 states and 39405 transitions. [2019-12-18 20:54:12,627 INFO L78 Accepts]: Start accepts. Automaton has 12719 states and 39405 transitions. Word has length 57 [2019-12-18 20:54:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:12,627 INFO L462 AbstractCegarLoop]: Abstraction has 12719 states and 39405 transitions. [2019-12-18 20:54:12,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:54:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 12719 states and 39405 transitions. [2019-12-18 20:54:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:12,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:12,641 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] [2019-12-18 20:54:12,641 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1206429816, now seen corresponding path program 2 times [2019-12-18 20:54:12,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:12,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072410959] [2019-12-18 20:54:12,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:12,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072410959] [2019-12-18 20:54:12,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:12,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:54:12,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315130882] [2019-12-18 20:54:12,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:54:12,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:54:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:12,732 INFO L87 Difference]: Start difference. First operand 12719 states and 39405 transitions. Second operand 7 states. [2019-12-18 20:54:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:13,150 INFO L93 Difference]: Finished difference Result 34451 states and 105542 transitions. [2019-12-18 20:54:13,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:54:13,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:54:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:13,204 INFO L225 Difference]: With dead ends: 34451 [2019-12-18 20:54:13,205 INFO L226 Difference]: Without dead ends: 25293 [2019-12-18 20:54:13,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:54:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25293 states. [2019-12-18 20:54:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25293 to 15331. [2019-12-18 20:54:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15331 states. [2019-12-18 20:54:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15331 states to 15331 states and 47433 transitions. [2019-12-18 20:54:13,683 INFO L78 Accepts]: Start accepts. Automaton has 15331 states and 47433 transitions. Word has length 57 [2019-12-18 20:54:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:13,684 INFO L462 AbstractCegarLoop]: Abstraction has 15331 states and 47433 transitions. [2019-12-18 20:54:13,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:54:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 15331 states and 47433 transitions. [2019-12-18 20:54:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:13,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:13,701 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] [2019-12-18 20:54:13,701 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:13,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash 460584032, now seen corresponding path program 3 times [2019-12-18 20:54:13,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:13,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601954046] [2019-12-18 20:54:13,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:13,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601954046] [2019-12-18 20:54:13,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:13,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:54:13,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288316112] [2019-12-18 20:54:13,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:54:13,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:13,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:54:13,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:13,793 INFO L87 Difference]: Start difference. First operand 15331 states and 47433 transitions. Second operand 7 states. [2019-12-18 20:54:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:14,264 INFO L93 Difference]: Finished difference Result 42947 states and 131081 transitions. [2019-12-18 20:54:14,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 20:54:14,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:54:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:14,311 INFO L225 Difference]: With dead ends: 42947 [2019-12-18 20:54:14,312 INFO L226 Difference]: Without dead ends: 30996 [2019-12-18 20:54:14,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:54:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30996 states. [2019-12-18 20:54:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30996 to 18912. [2019-12-18 20:54:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18912 states. [2019-12-18 20:54:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18912 states to 18912 states and 58596 transitions. [2019-12-18 20:54:14,680 INFO L78 Accepts]: Start accepts. Automaton has 18912 states and 58596 transitions. Word has length 57 [2019-12-18 20:54:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:14,680 INFO L462 AbstractCegarLoop]: Abstraction has 18912 states and 58596 transitions. [2019-12-18 20:54:14,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:54:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 18912 states and 58596 transitions. [2019-12-18 20:54:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:14,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:14,701 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] [2019-12-18 20:54:14,701 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1958355418, now seen corresponding path program 4 times [2019-12-18 20:54:14,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:14,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69039518] [2019-12-18 20:54:14,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:14,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69039518] [2019-12-18 20:54:14,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:14,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:54:14,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735914744] [2019-12-18 20:54:14,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:54:14,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:54:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:14,793 INFO L87 Difference]: Start difference. First operand 18912 states and 58596 transitions. Second operand 7 states. [2019-12-18 20:54:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:15,173 INFO L93 Difference]: Finished difference Result 38724 states and 117484 transitions. [2019-12-18 20:54:15,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:54:15,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:54:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:15,221 INFO L225 Difference]: With dead ends: 38724 [2019-12-18 20:54:15,221 INFO L226 Difference]: Without dead ends: 32236 [2019-12-18 20:54:15,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:54:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32236 states. [2019-12-18 20:54:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32236 to 19152. [2019-12-18 20:54:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19152 states. [2019-12-18 20:54:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19152 states to 19152 states and 59284 transitions. [2019-12-18 20:54:15,607 INFO L78 Accepts]: Start accepts. Automaton has 19152 states and 59284 transitions. Word has length 57 [2019-12-18 20:54:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:15,607 INFO L462 AbstractCegarLoop]: Abstraction has 19152 states and 59284 transitions. [2019-12-18 20:54:15,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:54:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 19152 states and 59284 transitions. [2019-12-18 20:54:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:15,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:15,627 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] [2019-12-18 20:54:15,627 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1662940808, now seen corresponding path program 5 times [2019-12-18 20:54:15,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:15,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635134689] [2019-12-18 20:54:15,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:15,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635134689] [2019-12-18 20:54:15,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:15,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:54:15,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241612626] [2019-12-18 20:54:15,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:54:15,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:15,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:54:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:54:15,756 INFO L87 Difference]: Start difference. First operand 19152 states and 59284 transitions. Second operand 7 states. [2019-12-18 20:54:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:17,120 INFO L93 Difference]: Finished difference Result 25800 states and 77682 transitions. [2019-12-18 20:54:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:54:17,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:54:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:17,158 INFO L225 Difference]: With dead ends: 25800 [2019-12-18 20:54:17,158 INFO L226 Difference]: Without dead ends: 25800 [2019-12-18 20:54:17,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:54:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25800 states. [2019-12-18 20:54:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25800 to 18049. [2019-12-18 20:54:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18049 states. [2019-12-18 20:54:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18049 states to 18049 states and 56035 transitions. [2019-12-18 20:54:17,484 INFO L78 Accepts]: Start accepts. Automaton has 18049 states and 56035 transitions. Word has length 57 [2019-12-18 20:54:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:17,484 INFO L462 AbstractCegarLoop]: Abstraction has 18049 states and 56035 transitions. [2019-12-18 20:54:17,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:54:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 18049 states and 56035 transitions. [2019-12-18 20:54:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:54:17,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:17,503 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] [2019-12-18 20:54:17,503 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:17,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1460335274, now seen corresponding path program 6 times [2019-12-18 20:54:17,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:17,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666886197] [2019-12-18 20:54:17,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:17,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666886197] [2019-12-18 20:54:17,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:17,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:54:17,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247732072] [2019-12-18 20:54:17,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:54:17,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:17,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:54:17,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:17,568 INFO L87 Difference]: Start difference. First operand 18049 states and 56035 transitions. Second operand 3 states. [2019-12-18 20:54:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:17,643 INFO L93 Difference]: Finished difference Result 18047 states and 56030 transitions. [2019-12-18 20:54:17,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:54:17,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:54:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:17,669 INFO L225 Difference]: With dead ends: 18047 [2019-12-18 20:54:17,669 INFO L226 Difference]: Without dead ends: 18047 [2019-12-18 20:54:17,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18047 states. [2019-12-18 20:54:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18047 to 17303. [2019-12-18 20:54:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17303 states. [2019-12-18 20:54:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17303 states to 17303 states and 54071 transitions. [2019-12-18 20:54:17,931 INFO L78 Accepts]: Start accepts. Automaton has 17303 states and 54071 transitions. Word has length 57 [2019-12-18 20:54:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:17,932 INFO L462 AbstractCegarLoop]: Abstraction has 17303 states and 54071 transitions. [2019-12-18 20:54:17,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:54:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 17303 states and 54071 transitions. [2019-12-18 20:54:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:54:17,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:17,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:54:17,951 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:17,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:17,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1032397913, now seen corresponding path program 1 times [2019-12-18 20:54:17,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:17,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120918337] [2019-12-18 20:54:17,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:54:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:54:18,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120918337] [2019-12-18 20:54:18,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:54:18,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:54:18,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744567312] [2019-12-18 20:54:18,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:54:18,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:54:18,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:54:18,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:18,031 INFO L87 Difference]: Start difference. First operand 17303 states and 54071 transitions. Second operand 3 states. [2019-12-18 20:54:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:54:18,096 INFO L93 Difference]: Finished difference Result 13484 states and 41216 transitions. [2019-12-18 20:54:18,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:54:18,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 20:54:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:54:18,121 INFO L225 Difference]: With dead ends: 13484 [2019-12-18 20:54:18,121 INFO L226 Difference]: Without dead ends: 13484 [2019-12-18 20:54:18,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:54:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13484 states. [2019-12-18 20:54:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13484 to 12954. [2019-12-18 20:54:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12954 states. [2019-12-18 20:54:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12954 states to 12954 states and 39506 transitions. [2019-12-18 20:54:18,358 INFO L78 Accepts]: Start accepts. Automaton has 12954 states and 39506 transitions. Word has length 58 [2019-12-18 20:54:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:54:18,358 INFO L462 AbstractCegarLoop]: Abstraction has 12954 states and 39506 transitions. [2019-12-18 20:54:18,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:54:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 12954 states and 39506 transitions. [2019-12-18 20:54:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:54:18,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:54:18,373 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] [2019-12-18 20:54:18,373 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:54:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:54:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1074141970, now seen corresponding path program 1 times [2019-12-18 20:54:18,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:54:18,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015347194] [2019-12-18 20:54:18,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:54:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:54:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:54:18,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:54:18,529 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:54:18,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_77| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.base_4) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~y$r_buff0_thd1~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= |v_#valid_75| (store .cse0 |v_ULTIMATE.start_main_~#t693~0.base_24| 1)) (= 0 v_~__unbuffered_p3_EAX~0_14) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t693~0.base_24|) (= 0 v_~y$r_buff1_thd4~0_19) (= v_~y$read_delayed~0_6 0) (= 0 |v_ULTIMATE.start_main_~#t693~0.offset_19|) (= v_~y~0_24 0) (= v_~y$r_buff0_thd3~0_28 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t693~0.base_24|)) (= v_~y$r_buff0_thd2~0_68 0) (= 0 v_~y$flush_delayed~0_13) (= v_~y$r_buff0_thd4~0_21 0) (= v_~y$r_buff1_thd1~0_9 0) (= v_~y$r_buff0_thd0~0_19 0) (= v_~z~0_16 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd0~0_21) (= 0 v_~__unbuffered_cnt~0_27) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t693~0.base_24| 4) |v_#length_31|) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~y$w_buff1_used~0_67 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_24|) |v_ULTIMATE.start_main_~#t693~0.offset_19| 0)) |v_#memory_int_25|) (= v_~y$mem_tmp~0_10 0) (= 0 v_~y$r_buff1_thd3~0_19) (= 0 v_~y$r_buff1_thd2~0_43))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_21|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ULTIMATE.start_main_~#t693~0.offset=|v_ULTIMATE.start_main_~#t693~0.offset_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, #length=|v_#length_31|, ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_16|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_16|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t693~0.base=|v_ULTIMATE.start_main_~#t693~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_21, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_26|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_20|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_22|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_19|, ~z~0=v_~z~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t693~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t695~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t693~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t694~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t694~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t695~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t696~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:54:18,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L843-1-->L845: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t694~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t694~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13|) |v_ULTIMATE.start_main_~#t694~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t694~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t694~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t694~0.base, ULTIMATE.start_main_~#t694~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:54:18,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t695~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t695~0.offset_9| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t695~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11|) |v_ULTIMATE.start_main_~#t695~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t695~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_9|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t695~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t695~0.base] because there is no mapped edge [2019-12-18 20:54:18,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= 1 v_~z~0_6) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff1_thd2~0_28) (= v_~y$r_buff0_thd0~0_14 v_~y$r_buff1_thd0~0_11) (= v_~y$r_buff0_thd3~0_16 1) (= v_~y$r_buff0_thd3~0_17 v_~y$r_buff1_thd3~0_13) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_12) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_12, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:54:18,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t696~0.base_9| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t696~0.base_9|)) (= |v_ULTIMATE.start_main_~#t696~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) |v_ULTIMATE.start_main_~#t696~0.offset_8| 3)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t696~0.base] because there is no mapped edge [2019-12-18 20:54:18,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] P0ENTRY-->P0EXIT: Formula: (and (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_7) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{~a~0=v_~a~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:54:18,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1814678603 256) 0))) (or (and (= ~y$w_buff1~0_In1814678603 |P1Thread1of1ForFork2_#t~ite12_Out1814678603|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In1814678603| |P1Thread1of1ForFork2_#t~ite11_Out1814678603|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1814678603 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1814678603 256)) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In1814678603 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1814678603 256)))) (= |P1Thread1of1ForFork2_#t~ite11_Out1814678603| |P1Thread1of1ForFork2_#t~ite12_Out1814678603|) (= ~y$w_buff1~0_In1814678603 |P1Thread1of1ForFork2_#t~ite11_Out1814678603|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1814678603, ~y$w_buff1~0=~y$w_buff1~0_In1814678603, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1814678603, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1814678603, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1814678603|, ~weak$$choice2~0=~weak$$choice2~0_In1814678603, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1814678603} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1814678603, ~y$w_buff1~0=~y$w_buff1~0_In1814678603, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1814678603, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1814678603, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1814678603|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1814678603|, ~weak$$choice2~0=~weak$$choice2~0_In1814678603, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1814678603} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:54:18,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1682743463 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out1682743463| |P1Thread1of1ForFork2_#t~ite14_Out1682743463|) .cse0 (= ~y$w_buff0_used~0_In1682743463 |P1Thread1of1ForFork2_#t~ite14_Out1682743463|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1682743463 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1682743463 256))) (= 0 (mod ~y$w_buff0_used~0_In1682743463 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1682743463 256)))))) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In1682743463| |P1Thread1of1ForFork2_#t~ite14_Out1682743463|) (= |P1Thread1of1ForFork2_#t~ite15_Out1682743463| ~y$w_buff0_used~0_In1682743463)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1682743463, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1682743463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1682743463, ~weak$$choice2~0=~weak$$choice2~0_In1682743463, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1682743463|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1682743463} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1682743463, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1682743463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1682743463, ~weak$$choice2~0=~weak$$choice2~0_In1682743463, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1682743463|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1682743463|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1682743463} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 20:54:18,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L764-->L764-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite17_Out1031809059| |P1Thread1of1ForFork2_#t~ite18_Out1031809059|)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1031809059 256) 0)) (.cse4 (= (mod ~y$w_buff1_used~0_In1031809059 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1031809059 256) 0)) (.cse5 (= (mod ~weak$$choice2~0_In1031809059 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1031809059 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite16_In1031809059| |P1Thread1of1ForFork2_#t~ite16_Out1031809059|) (or (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse5 (= ~y$w_buff1_used~0_In1031809059 |P1Thread1of1ForFork2_#t~ite17_Out1031809059|)) (and (= ~y$w_buff1_used~0_In1031809059 |P1Thread1of1ForFork2_#t~ite18_Out1031809059|) (not .cse5) (= |P1Thread1of1ForFork2_#t~ite17_Out1031809059| |P1Thread1of1ForFork2_#t~ite17_In1031809059|)))) (let ((.cse6 (not .cse2))) (and .cse0 (or (not .cse3) .cse6) (= 0 |P1Thread1of1ForFork2_#t~ite16_Out1031809059|) (or (not .cse4) .cse6) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite17_Out1031809059| |P1Thread1of1ForFork2_#t~ite16_Out1031809059|) .cse5)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1031809059, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In1031809059|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1031809059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1031809059, ~weak$$choice2~0=~weak$$choice2~0_In1031809059, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In1031809059|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1031809059} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out1031809059|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1031809059, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out1031809059|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1031809059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1031809059, ~weak$$choice2~0=~weak$$choice2~0_In1031809059, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out1031809059|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1031809059} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 20:54:18,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L765-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff0_thd2~0_36) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_36, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:54:18,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-24472398 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In-24472398 |P1Thread1of1ForFork2_#t~ite24_Out-24472398|) (= |P1Thread1of1ForFork2_#t~ite23_In-24472398| |P1Thread1of1ForFork2_#t~ite23_Out-24472398|)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-24472398| |P1Thread1of1ForFork2_#t~ite23_Out-24472398|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-24472398 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-24472398 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-24472398 256))) (= 0 (mod ~y$w_buff0_used~0_In-24472398 256)))) (= ~y$r_buff1_thd2~0_In-24472398 |P1Thread1of1ForFork2_#t~ite23_Out-24472398|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-24472398, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-24472398, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-24472398, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-24472398|, ~weak$$choice2~0=~weak$$choice2~0_In-24472398, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-24472398} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-24472398, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-24472398, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-24472398, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-24472398|, ~weak$$choice2~0=~weak$$choice2~0_In-24472398, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-24472398|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-24472398} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 20:54:18,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:54:18,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out1542669556| |P3Thread1of1ForFork0_#t~ite32_Out1542669556|)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1542669556 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1542669556 256)))) (or (and .cse0 (= ~y$w_buff1~0_In1542669556 |P3Thread1of1ForFork0_#t~ite32_Out1542669556|) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~y~0_In1542669556 |P3Thread1of1ForFork0_#t~ite32_Out1542669556|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1542669556, ~y$w_buff1~0=~y$w_buff1~0_In1542669556, ~y~0=~y~0_In1542669556, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1542669556} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1542669556, ~y$w_buff1~0=~y$w_buff1~0_In1542669556, ~y~0=~y~0_In1542669556, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1542669556|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1542669556|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1542669556} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:54:18,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In2041907893 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2041907893 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out2041907893| ~y$w_buff0_used~0_In2041907893)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out2041907893| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2041907893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2041907893} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2041907893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2041907893, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out2041907893|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 20:54:18,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In372341127 256))) (.cse2 (= (mod ~y$r_buff0_thd4~0_In372341127 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In372341127 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In372341127 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In372341127 |P3Thread1of1ForFork0_#t~ite35_Out372341127|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out372341127|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In372341127, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In372341127, ~y$w_buff0_used~0=~y$w_buff0_used~0_In372341127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In372341127} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In372341127, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In372341127, ~y$w_buff0_used~0=~y$w_buff0_used~0_In372341127, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out372341127|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In372341127} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 20:54:18,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1460770941 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In1460770941 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out1460770941| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out1460770941| ~y$r_buff0_thd4~0_In1460770941)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1460770941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1460770941} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1460770941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1460770941, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1460770941|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 20:54:18,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In-1307108734 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1307108734 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1307108734 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In-1307108734 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out-1307108734| ~y$r_buff1_thd4~0_In-1307108734)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out-1307108734| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1307108734, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1307108734, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1307108734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1307108734} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1307108734, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1307108734, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1307108734, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1307108734|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1307108734} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 20:54:18,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_16) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_16, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:54:18,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-783800689 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-783800689 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite28_Out-783800689| ~y$w_buff0_used~0_In-783800689) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork3_#t~ite28_Out-783800689| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-783800689, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-783800689} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-783800689, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-783800689, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-783800689|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 20:54:18,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-637749477 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-637749477 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-637749477 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-637749477 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-637749477|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-637749477 |P2Thread1of1ForFork3_#t~ite29_Out-637749477|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-637749477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-637749477, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-637749477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-637749477} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-637749477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-637749477, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-637749477, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-637749477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-637749477} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 20:54:18,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1991131365 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1991131365 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out1991131365 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_Out1991131365 ~y$r_buff0_thd3~0_In1991131365)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1991131365, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1991131365} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1991131365|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1991131365, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1991131365} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 20:54:18,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-2136425218 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-2136425218 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-2136425218 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2136425218 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out-2136425218| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork3_#t~ite31_Out-2136425218| ~y$r_buff1_thd3~0_In-2136425218)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2136425218, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2136425218, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2136425218, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2136425218} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2136425218, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2136425218, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2136425218, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-2136425218|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2136425218} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 20:54:18,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_15) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 20:54:18,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:54:18,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1461041966 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1461041966 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1461041966| ~y$w_buff1~0_In-1461041966) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1461041966| ~y~0_In-1461041966) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1461041966, ~y~0=~y~0_In-1461041966, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1461041966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1461041966} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1461041966, ~y~0=~y~0_In-1461041966, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1461041966|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1461041966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1461041966} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:54:18,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite42_8|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_7|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:54:18,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2146094261 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2146094261 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out2146094261| ~y$w_buff0_used~0_In2146094261) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out2146094261|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2146094261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146094261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2146094261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146094261, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2146094261|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:54:18,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1259365802 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1259365802 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1259365802 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1259365802 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1259365802 |ULTIMATE.start_main_#t~ite45_Out-1259365802|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1259365802|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1259365802, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1259365802, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1259365802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1259365802} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1259365802, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1259365802, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1259365802, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1259365802|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1259365802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:54:18,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In754591581 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In754591581 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite46_Out754591581|)) (and (= ~y$r_buff0_thd0~0_In754591581 |ULTIMATE.start_main_#t~ite46_Out754591581|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In754591581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In754591581} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In754591581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In754591581, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out754591581|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:54:18,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1946667979 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1946667979 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1946667979 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1946667979 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out1946667979|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In1946667979 |ULTIMATE.start_main_#t~ite47_Out1946667979|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1946667979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1946667979, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1946667979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1946667979} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1946667979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1946667979, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1946667979|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1946667979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1946667979} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:54:18,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_12 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite47_15| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~__unbuffered_p0_EAX~0_11) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 2 v_~__unbuffered_p3_EAX~0_10) (= 0 v_~__unbuffered_p3_EBX~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, ~z~0=v_~z~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:54:18,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:54:18 BasicIcfg [2019-12-18 20:54:18,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:54:18,652 INFO L168 Benchmark]: Toolchain (without parser) took 135904.28 ms. Allocated memory was 145.8 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 101.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 20:54:18,652 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 20:54:18,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.26 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 156.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:54:18,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.31 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:54:18,654 INFO L168 Benchmark]: Boogie Preprocessor took 38.22 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:54:18,654 INFO L168 Benchmark]: RCFGBuilder took 841.37 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 102.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:54:18,655 INFO L168 Benchmark]: TraceAbstraction took 134172.02 ms. Allocated memory was 203.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 102.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 20:54:18,658 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.26 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 156.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.31 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.22 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.37 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 102.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134172.02 ms. Allocated memory was 203.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 102.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 181 ProgramPointsBefore, 89 ProgramPointsAfterwards, 209 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 7757 VarBasedMoverChecksPositive, 195 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68785 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L849] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 4 z = 2 [L814] 4 __unbuffered_p3_EAX = z [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 1 [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 133.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3103 SDtfs, 3601 SDslu, 6872 SDs, 0 SdLazy, 3217 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227148occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 65.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 109951 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 686 ConstructedInterpolants, 0 QuantifiedInterpolants, 85360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...