/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/mix003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:59:05,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:59:05,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:59:05,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:59:05,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:59:05,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:59:05,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:59:05,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:59:05,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:59:05,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:59:05,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:59:05,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:59:05,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:59:05,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:59:05,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:59:05,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:59:05,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:59:05,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:59:05,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:59:05,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:59:05,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:59:05,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:59:05,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:59:05,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:59:05,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:59:05,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:59:05,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:59:05,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:59:05,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:59:05,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:59:05,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:59:05,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:59:05,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:59:05,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:59:05,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:59:05,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:59:05,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:59:05,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:59:05,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:59:05,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:59:05,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:59:05,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 19:59:05,434 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:59:05,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:59:05,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:59:05,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:59:05,437 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:59:05,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:59:05,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:59:05,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:59:05,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:59:05,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:59:05,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:59:05,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:59:05,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:59:05,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:59:05,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:59:05,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:59:05,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:59:05,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:59:05,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:59:05,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:59:05,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:59:05,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:59:05,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:59:05,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:59:05,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:59:05,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:59:05,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:59:05,442 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 19:59:05,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:59:05,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:59:05,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:59:05,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:59:05,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:59:05,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:59:05,729 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:59:05,730 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-18 19:59:05,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e72ff0e/5f00af40a57a499795e91390e3283263/FLAG9134a0183 [2019-12-18 19:59:06,374 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:59:06,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-18 19:59:06,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e72ff0e/5f00af40a57a499795e91390e3283263/FLAG9134a0183 [2019-12-18 19:59:06,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e72ff0e/5f00af40a57a499795e91390e3283263 [2019-12-18 19:59:06,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:59:06,636 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:59:06,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:59:06,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:59:06,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:59:06,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:59:06" (1/1) ... [2019-12-18 19:59:06,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663f26a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:06, skipping insertion in model container [2019-12-18 19:59:06,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:59:06" (1/1) ... [2019-12-18 19:59:06,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:59:06,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:59:07,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:59:07,286 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:59:07,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:59:07,462 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:59:07,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07 WrapperNode [2019-12-18 19:59:07,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:59:07,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:59:07,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:59:07,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:59:07,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (1/1) ... [2019-12-18 19:59:07,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (1/1) ... [2019-12-18 19:59:07,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:59:07,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:59:07,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:59:07,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:59:07,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (1/1) ... [2019-12-18 19:59:07,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (1/1) ... [2019-12-18 19:59:07,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (1/1) ... [2019-12-18 19:59:07,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (1/1) ... [2019-12-18 19:59:07,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (1/1) ... [2019-12-18 19:59:07,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (1/1) ... [2019-12-18 19:59:07,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (1/1) ... [2019-12-18 19:59:07,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:59:07,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:59:07,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:59:07,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:59:07,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (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 19:59:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:59:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:59:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:59:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:59:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:59:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:59:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:59:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:59:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:59:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:59:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:59:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:59:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:59:07,676 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 19:59:08,541 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:59:08,541 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:59:08,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:59:08 BoogieIcfgContainer [2019-12-18 19:59:08,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:59:08,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:59:08,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:59:08,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:59:08,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:59:06" (1/3) ... [2019-12-18 19:59:08,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cebec6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:59:08, skipping insertion in model container [2019-12-18 19:59:08,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:59:07" (2/3) ... [2019-12-18 19:59:08,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cebec6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:59:08, skipping insertion in model container [2019-12-18 19:59:08,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:59:08" (3/3) ... [2019-12-18 19:59:08,552 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_power.oepc.i [2019-12-18 19:59:08,562 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:59:08,563 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:59:08,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:59:08,571 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:59:08,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,624 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,625 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,633 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,633 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,681 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,696 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:59:08,715 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:59:08,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:59:08,736 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:59:08,737 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:59:08,737 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:59:08,737 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:59:08,737 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:59:08,737 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:59:08,737 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:59:08,755 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 19:59:08,757 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 19:59:08,873 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 19:59:08,873 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:59:08,897 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 19:59:08,926 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 19:59:09,026 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 19:59:09,026 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:59:09,037 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 19:59:09,063 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 19:59:09,064 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 19:59:12,739 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 19:59:12,874 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 19:59:12,901 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85139 [2019-12-18 19:59:12,902 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 19:59:12,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-18 19:59:31,455 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115082 states. [2019-12-18 19:59:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 115082 states. [2019-12-18 19:59:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:59:31,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:59:31,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:59:31,463 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:59:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:59:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-18 19:59:31,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:59:31,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244698833] [2019-12-18 19:59:31,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:59:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:59:31,678 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 19:59:31,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244698833] [2019-12-18 19:59:31,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:59:31,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:59:31,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3972432] [2019-12-18 19:59:31,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:59:31,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:59:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:59:31,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:59:31,703 INFO L87 Difference]: Start difference. First operand 115082 states. Second operand 3 states. [2019-12-18 19:59:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:59:33,216 INFO L93 Difference]: Finished difference Result 114348 states and 491658 transitions. [2019-12-18 19:59:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:59:33,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:59:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:59:36,821 INFO L225 Difference]: With dead ends: 114348 [2019-12-18 19:59:36,821 INFO L226 Difference]: Without dead ends: 107250 [2019-12-18 19:59:36,823 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 19:59:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107250 states. [2019-12-18 19:59:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107250 to 107250. [2019-12-18 19:59:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107250 states. [2019-12-18 19:59:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107250 states to 107250 states and 460523 transitions. [2019-12-18 19:59:47,027 INFO L78 Accepts]: Start accepts. Automaton has 107250 states and 460523 transitions. Word has length 3 [2019-12-18 19:59:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:59:47,027 INFO L462 AbstractCegarLoop]: Abstraction has 107250 states and 460523 transitions. [2019-12-18 19:59:47,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:59:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 107250 states and 460523 transitions. [2019-12-18 19:59:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:59:47,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:59:47,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:59:47,040 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:59:47,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:59:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash -906390211, now seen corresponding path program 1 times [2019-12-18 19:59:47,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:59:47,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831288207] [2019-12-18 19:59:47,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:59:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:59:47,199 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 19:59:47,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831288207] [2019-12-18 19:59:47,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:59:47,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:59:47,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102876051] [2019-12-18 19:59:47,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:59:47,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:59:47,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:59:47,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:59:47,203 INFO L87 Difference]: Start difference. First operand 107250 states and 460523 transitions. Second operand 4 states. [2019-12-18 19:59:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:59:52,453 INFO L93 Difference]: Finished difference Result 171260 states and 704759 transitions. [2019-12-18 19:59:52,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:59:52,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:59:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:59:53,152 INFO L225 Difference]: With dead ends: 171260 [2019-12-18 19:59:53,152 INFO L226 Difference]: Without dead ends: 171211 [2019-12-18 19:59:53,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:59:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171211 states. [2019-12-18 20:00:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171211 to 155734. [2019-12-18 20:00:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155734 states. [2019-12-18 20:00:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155734 states to 155734 states and 649769 transitions. [2019-12-18 20:00:02,828 INFO L78 Accepts]: Start accepts. Automaton has 155734 states and 649769 transitions. Word has length 11 [2019-12-18 20:00:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:02,828 INFO L462 AbstractCegarLoop]: Abstraction has 155734 states and 649769 transitions. [2019-12-18 20:00:02,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:00:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 155734 states and 649769 transitions. [2019-12-18 20:00:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:00:02,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:02,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:02,835 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:02,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:02,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1306732541, now seen corresponding path program 1 times [2019-12-18 20:00:02,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:02,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528333657] [2019-12-18 20:00:02,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:02,892 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:00:02,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528333657] [2019-12-18 20:00:02,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:02,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:00:02,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101857708] [2019-12-18 20:00:02,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:00:02,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:00:02,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:00:02,894 INFO L87 Difference]: Start difference. First operand 155734 states and 649769 transitions. Second operand 3 states. [2019-12-18 20:00:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:03,029 INFO L93 Difference]: Finished difference Result 34176 states and 112026 transitions. [2019-12-18 20:00:03,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:00:03,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:00:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:03,095 INFO L225 Difference]: With dead ends: 34176 [2019-12-18 20:00:03,095 INFO L226 Difference]: Without dead ends: 34176 [2019-12-18 20:00:03,096 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:00:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34176 states. [2019-12-18 20:00:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34176 to 34176. [2019-12-18 20:00:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34176 states. [2019-12-18 20:00:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34176 states to 34176 states and 112026 transitions. [2019-12-18 20:00:08,638 INFO L78 Accepts]: Start accepts. Automaton has 34176 states and 112026 transitions. Word has length 13 [2019-12-18 20:00:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:08,638 INFO L462 AbstractCegarLoop]: Abstraction has 34176 states and 112026 transitions. [2019-12-18 20:00:08,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:00:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 34176 states and 112026 transitions. [2019-12-18 20:00:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:00:08,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:08,641 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:00:08,641 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:08,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:08,641 INFO L82 PathProgramCache]: Analyzing trace with hash 54051154, now seen corresponding path program 1 times [2019-12-18 20:00:08,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:08,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325521037] [2019-12-18 20:00:08,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:08,758 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:00:08,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325521037] [2019-12-18 20:00:08,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:08,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:00:08,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795903704] [2019-12-18 20:00:08,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:00:08,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:00:08,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:00:08,764 INFO L87 Difference]: Start difference. First operand 34176 states and 112026 transitions. Second operand 4 states. [2019-12-18 20:00:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:09,134 INFO L93 Difference]: Finished difference Result 42178 states and 136956 transitions. [2019-12-18 20:00:09,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:00:09,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:00:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:09,206 INFO L225 Difference]: With dead ends: 42178 [2019-12-18 20:00:09,206 INFO L226 Difference]: Without dead ends: 42178 [2019-12-18 20:00:09,207 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:00:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42178 states. [2019-12-18 20:00:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42178 to 38132. [2019-12-18 20:00:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38132 states. [2019-12-18 20:00:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38132 states to 38132 states and 124449 transitions. [2019-12-18 20:00:10,328 INFO L78 Accepts]: Start accepts. Automaton has 38132 states and 124449 transitions. Word has length 16 [2019-12-18 20:00:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:10,330 INFO L462 AbstractCegarLoop]: Abstraction has 38132 states and 124449 transitions. [2019-12-18 20:00:10,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:00:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 38132 states and 124449 transitions. [2019-12-18 20:00:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:00:10,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:10,333 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:00:10,333 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash 53948296, now seen corresponding path program 1 times [2019-12-18 20:00:10,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:10,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824069451] [2019-12-18 20:00:10,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:10,395 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:00:10,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824069451] [2019-12-18 20:00:10,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:10,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:00:10,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42211336] [2019-12-18 20:00:10,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:00:10,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:10,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:00:10,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:00:10,397 INFO L87 Difference]: Start difference. First operand 38132 states and 124449 transitions. Second operand 3 states. [2019-12-18 20:00:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:10,663 INFO L93 Difference]: Finished difference Result 55464 states and 180253 transitions. [2019-12-18 20:00:10,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:00:10,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 20:00:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:10,772 INFO L225 Difference]: With dead ends: 55464 [2019-12-18 20:00:10,772 INFO L226 Difference]: Without dead ends: 55464 [2019-12-18 20:00:10,773 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:00:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55464 states. [2019-12-18 20:00:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55464 to 42552. [2019-12-18 20:00:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42552 states. [2019-12-18 20:00:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42552 states to 42552 states and 139903 transitions. [2019-12-18 20:00:11,632 INFO L78 Accepts]: Start accepts. Automaton has 42552 states and 139903 transitions. Word has length 16 [2019-12-18 20:00:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:11,633 INFO L462 AbstractCegarLoop]: Abstraction has 42552 states and 139903 transitions. [2019-12-18 20:00:11,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:00:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 42552 states and 139903 transitions. [2019-12-18 20:00:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:00:11,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:11,637 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:00:11,637 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:11,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:11,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1761611220, now seen corresponding path program 1 times [2019-12-18 20:00:11,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:11,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003137550] [2019-12-18 20:00:11,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:11,698 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:00:11,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003137550] [2019-12-18 20:00:11,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:11,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:00:11,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649320225] [2019-12-18 20:00:11,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:00:11,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:11,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:00:11,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:00:11,703 INFO L87 Difference]: Start difference. First operand 42552 states and 139903 transitions. Second operand 4 states. [2019-12-18 20:00:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:12,412 INFO L93 Difference]: Finished difference Result 50497 states and 164640 transitions. [2019-12-18 20:00:12,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:00:12,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:00:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:12,500 INFO L225 Difference]: With dead ends: 50497 [2019-12-18 20:00:12,500 INFO L226 Difference]: Without dead ends: 50497 [2019-12-18 20:00:12,500 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:00:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50497 states. [2019-12-18 20:00:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50497 to 44016. [2019-12-18 20:00:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44016 states. [2019-12-18 20:00:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44016 states to 44016 states and 144770 transitions. [2019-12-18 20:00:13,296 INFO L78 Accepts]: Start accepts. Automaton has 44016 states and 144770 transitions. Word has length 16 [2019-12-18 20:00:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:13,297 INFO L462 AbstractCegarLoop]: Abstraction has 44016 states and 144770 transitions. [2019-12-18 20:00:13,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:00:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 44016 states and 144770 transitions. [2019-12-18 20:00:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:00:13,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:13,306 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] [2019-12-18 20:00:13,306 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1491539652, now seen corresponding path program 1 times [2019-12-18 20:00:13,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:13,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901413313] [2019-12-18 20:00:13,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:13,391 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:00:13,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901413313] [2019-12-18 20:00:13,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:13,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:00:13,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847986520] [2019-12-18 20:00:13,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:00:13,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:13,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:00:13,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:00:13,393 INFO L87 Difference]: Start difference. First operand 44016 states and 144770 transitions. Second operand 5 states. [2019-12-18 20:00:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:14,058 INFO L93 Difference]: Finished difference Result 60577 states and 194051 transitions. [2019-12-18 20:00:14,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:00:14,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:00:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:14,176 INFO L225 Difference]: With dead ends: 60577 [2019-12-18 20:00:14,176 INFO L226 Difference]: Without dead ends: 60570 [2019-12-18 20:00:14,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:00:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60570 states. [2019-12-18 20:00:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60570 to 45150. [2019-12-18 20:00:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45150 states. [2019-12-18 20:00:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45150 states to 45150 states and 148226 transitions. [2019-12-18 20:00:15,441 INFO L78 Accepts]: Start accepts. Automaton has 45150 states and 148226 transitions. Word has length 22 [2019-12-18 20:00:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:15,441 INFO L462 AbstractCegarLoop]: Abstraction has 45150 states and 148226 transitions. [2019-12-18 20:00:15,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:00:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 45150 states and 148226 transitions. [2019-12-18 20:00:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:00:15,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:15,450 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] [2019-12-18 20:00:15,450 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:15,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash 987765270, now seen corresponding path program 1 times [2019-12-18 20:00:15,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:15,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993246869] [2019-12-18 20:00:15,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:00:15,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993246869] [2019-12-18 20:00:15,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:15,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:00:15,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791909899] [2019-12-18 20:00:15,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:00:15,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:00:15,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:00:15,525 INFO L87 Difference]: Start difference. First operand 45150 states and 148226 transitions. Second operand 5 states. [2019-12-18 20:00:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:16,319 INFO L93 Difference]: Finished difference Result 63824 states and 203774 transitions. [2019-12-18 20:00:16,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:00:16,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:00:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:16,499 INFO L225 Difference]: With dead ends: 63824 [2019-12-18 20:00:16,499 INFO L226 Difference]: Without dead ends: 63817 [2019-12-18 20:00:16,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:00:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63817 states. [2019-12-18 20:00:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63817 to 43599. [2019-12-18 20:00:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43599 states. [2019-12-18 20:00:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43599 states to 43599 states and 143212 transitions. [2019-12-18 20:00:17,984 INFO L78 Accepts]: Start accepts. Automaton has 43599 states and 143212 transitions. Word has length 22 [2019-12-18 20:00:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:17,985 INFO L462 AbstractCegarLoop]: Abstraction has 43599 states and 143212 transitions. [2019-12-18 20:00:17,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:00:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 43599 states and 143212 transitions. [2019-12-18 20:00:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:00:17,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:17,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:17,997 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:17,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:17,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1953235153, now seen corresponding path program 1 times [2019-12-18 20:00:17,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:17,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109584169] [2019-12-18 20:00:17,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:18,066 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:00:18,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109584169] [2019-12-18 20:00:18,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:18,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:00:18,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831041549] [2019-12-18 20:00:18,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:00:18,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:18,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:00:18,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:00:18,069 INFO L87 Difference]: Start difference. First operand 43599 states and 143212 transitions. Second operand 4 states. [2019-12-18 20:00:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:18,156 INFO L93 Difference]: Finished difference Result 17791 states and 55309 transitions. [2019-12-18 20:00:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:00:18,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:00:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:18,193 INFO L225 Difference]: With dead ends: 17791 [2019-12-18 20:00:18,194 INFO L226 Difference]: Without dead ends: 17791 [2019-12-18 20:00:18,194 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:00:18,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17791 states. [2019-12-18 20:00:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17791 to 17428. [2019-12-18 20:00:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-18 20:00:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 54273 transitions. [2019-12-18 20:00:18,489 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 54273 transitions. Word has length 25 [2019-12-18 20:00:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:18,489 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 54273 transitions. [2019-12-18 20:00:18,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:00:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 54273 transitions. [2019-12-18 20:00:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:00:18,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:18,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:18,504 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:18,504 INFO L82 PathProgramCache]: Analyzing trace with hash 451000002, now seen corresponding path program 1 times [2019-12-18 20:00:18,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:18,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058864432] [2019-12-18 20:00:18,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:18,547 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:00:18,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058864432] [2019-12-18 20:00:18,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:18,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:00:18,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090870422] [2019-12-18 20:00:18,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:00:18,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:00:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:00:18,550 INFO L87 Difference]: Start difference. First operand 17428 states and 54273 transitions. Second operand 3 states. [2019-12-18 20:00:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:18,646 INFO L93 Difference]: Finished difference Result 22857 states and 67585 transitions. [2019-12-18 20:00:18,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:00:18,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 20:00:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:18,683 INFO L225 Difference]: With dead ends: 22857 [2019-12-18 20:00:18,684 INFO L226 Difference]: Without dead ends: 22857 [2019-12-18 20:00:18,684 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:00:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-12-18 20:00:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 17428. [2019-12-18 20:00:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-18 20:00:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 51895 transitions. [2019-12-18 20:00:19,009 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 51895 transitions. Word has length 27 [2019-12-18 20:00:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:19,009 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 51895 transitions. [2019-12-18 20:00:19,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:00:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 51895 transitions. [2019-12-18 20:00:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:00:19,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:19,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:19,022 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:19,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:19,023 INFO L82 PathProgramCache]: Analyzing trace with hash -319576223, now seen corresponding path program 1 times [2019-12-18 20:00:19,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:19,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084681745] [2019-12-18 20:00:19,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:19,111 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:00:19,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084681745] [2019-12-18 20:00:19,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:19,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:00:19,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728084465] [2019-12-18 20:00:19,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:00:19,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:19,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:00:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:00:19,114 INFO L87 Difference]: Start difference. First operand 17428 states and 51895 transitions. Second operand 5 states. [2019-12-18 20:00:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:19,518 INFO L93 Difference]: Finished difference Result 21434 states and 63020 transitions. [2019-12-18 20:00:19,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:00:19,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:00:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:19,557 INFO L225 Difference]: With dead ends: 21434 [2019-12-18 20:00:19,557 INFO L226 Difference]: Without dead ends: 21434 [2019-12-18 20:00:19,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:00:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-12-18 20:00:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 20103. [2019-12-18 20:00:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20103 states. [2019-12-18 20:00:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20103 states to 20103 states and 59665 transitions. [2019-12-18 20:00:20,187 INFO L78 Accepts]: Start accepts. Automaton has 20103 states and 59665 transitions. Word has length 27 [2019-12-18 20:00:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:20,187 INFO L462 AbstractCegarLoop]: Abstraction has 20103 states and 59665 transitions. [2019-12-18 20:00:20,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:00:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 20103 states and 59665 transitions. [2019-12-18 20:00:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:00:20,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:20,202 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:00:20,202 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:20,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:20,203 INFO L82 PathProgramCache]: Analyzing trace with hash -19850815, now seen corresponding path program 1 times [2019-12-18 20:00:20,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:20,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407202409] [2019-12-18 20:00:20,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:20,297 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:00:20,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407202409] [2019-12-18 20:00:20,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:20,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:00:20,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033294997] [2019-12-18 20:00:20,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:00:20,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:00:20,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:00:20,302 INFO L87 Difference]: Start difference. First operand 20103 states and 59665 transitions. Second operand 5 states. [2019-12-18 20:00:20,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:20,435 INFO L93 Difference]: Finished difference Result 20407 states and 60436 transitions. [2019-12-18 20:00:20,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:00:20,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:00:20,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:20,470 INFO L225 Difference]: With dead ends: 20407 [2019-12-18 20:00:20,470 INFO L226 Difference]: Without dead ends: 20407 [2019-12-18 20:00:20,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:00:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20407 states. [2019-12-18 20:00:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20407 to 20407. [2019-12-18 20:00:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20407 states. [2019-12-18 20:00:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20407 states to 20407 states and 60436 transitions. [2019-12-18 20:00:20,772 INFO L78 Accepts]: Start accepts. Automaton has 20407 states and 60436 transitions. Word has length 28 [2019-12-18 20:00:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:20,772 INFO L462 AbstractCegarLoop]: Abstraction has 20407 states and 60436 transitions. [2019-12-18 20:00:20,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:00:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20407 states and 60436 transitions. [2019-12-18 20:00:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 20:00:20,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:20,788 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] [2019-12-18 20:00:20,788 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1237552585, now seen corresponding path program 1 times [2019-12-18 20:00:20,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:20,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575587216] [2019-12-18 20:00:20,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:20,876 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:00:20,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575587216] [2019-12-18 20:00:20,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:20,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:00:20,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321416705] [2019-12-18 20:00:20,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:00:20,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:20,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:00:20,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:00:20,878 INFO L87 Difference]: Start difference. First operand 20407 states and 60436 transitions. Second operand 5 states. [2019-12-18 20:00:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:21,294 INFO L93 Difference]: Finished difference Result 23784 states and 69539 transitions. [2019-12-18 20:00:21,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:00:21,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 20:00:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:21,329 INFO L225 Difference]: With dead ends: 23784 [2019-12-18 20:00:21,330 INFO L226 Difference]: Without dead ends: 23784 [2019-12-18 20:00:21,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:00:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23784 states. [2019-12-18 20:00:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23784 to 20614. [2019-12-18 20:00:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20614 states. [2019-12-18 20:00:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20614 states to 20614 states and 60980 transitions. [2019-12-18 20:00:21,684 INFO L78 Accepts]: Start accepts. Automaton has 20614 states and 60980 transitions. Word has length 29 [2019-12-18 20:00:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:21,684 INFO L462 AbstractCegarLoop]: Abstraction has 20614 states and 60980 transitions. [2019-12-18 20:00:21,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:00:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20614 states and 60980 transitions. [2019-12-18 20:00:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:00:21,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:21,707 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] [2019-12-18 20:00:21,707 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 900090167, now seen corresponding path program 1 times [2019-12-18 20:00:21,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:21,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173252362] [2019-12-18 20:00:21,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:21,819 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:00:21,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173252362] [2019-12-18 20:00:21,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:21,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:00:21,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132859549] [2019-12-18 20:00:21,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:00:21,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:21,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:00:21,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:00:21,825 INFO L87 Difference]: Start difference. First operand 20614 states and 60980 transitions. Second operand 6 states. [2019-12-18 20:00:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:22,629 INFO L93 Difference]: Finished difference Result 27479 states and 79870 transitions. [2019-12-18 20:00:22,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:00:22,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 20:00:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:22,666 INFO L225 Difference]: With dead ends: 27479 [2019-12-18 20:00:22,666 INFO L226 Difference]: Without dead ends: 27479 [2019-12-18 20:00:22,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:00:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27479 states. [2019-12-18 20:00:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27479 to 21693. [2019-12-18 20:00:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21693 states. [2019-12-18 20:00:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21693 states to 21693 states and 64090 transitions. [2019-12-18 20:00:23,325 INFO L78 Accepts]: Start accepts. Automaton has 21693 states and 64090 transitions. Word has length 33 [2019-12-18 20:00:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:23,325 INFO L462 AbstractCegarLoop]: Abstraction has 21693 states and 64090 transitions. [2019-12-18 20:00:23,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:00:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 21693 states and 64090 transitions. [2019-12-18 20:00:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:00:23,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:23,344 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] [2019-12-18 20:00:23,344 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:23,345 INFO L82 PathProgramCache]: Analyzing trace with hash 810881567, now seen corresponding path program 1 times [2019-12-18 20:00:23,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:23,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839809876] [2019-12-18 20:00:23,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:23,449 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:00:23,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839809876] [2019-12-18 20:00:23,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:23,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:00:23,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988289707] [2019-12-18 20:00:23,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:00:23,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:00:23,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:00:23,451 INFO L87 Difference]: Start difference. First operand 21693 states and 64090 transitions. Second operand 6 states. [2019-12-18 20:00:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:24,200 INFO L93 Difference]: Finished difference Result 26605 states and 77567 transitions. [2019-12-18 20:00:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:00:24,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 20:00:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:24,245 INFO L225 Difference]: With dead ends: 26605 [2019-12-18 20:00:24,245 INFO L226 Difference]: Without dead ends: 26605 [2019-12-18 20:00:24,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:00:24,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2019-12-18 20:00:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 18643. [2019-12-18 20:00:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18643 states. [2019-12-18 20:00:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18643 states to 18643 states and 55403 transitions. [2019-12-18 20:00:24,584 INFO L78 Accepts]: Start accepts. Automaton has 18643 states and 55403 transitions. Word has length 35 [2019-12-18 20:00:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:24,584 INFO L462 AbstractCegarLoop]: Abstraction has 18643 states and 55403 transitions. [2019-12-18 20:00:24,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:00:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 18643 states and 55403 transitions. [2019-12-18 20:00:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:00:24,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:24,602 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] [2019-12-18 20:00:24,602 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:24,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash 173355914, now seen corresponding path program 1 times [2019-12-18 20:00:24,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:24,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669592303] [2019-12-18 20:00:24,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:24,651 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:00:24,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669592303] [2019-12-18 20:00:24,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:24,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:00:24,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950742206] [2019-12-18 20:00:24,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:00:24,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:24,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:00:24,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:00:24,653 INFO L87 Difference]: Start difference. First operand 18643 states and 55403 transitions. Second operand 3 states. [2019-12-18 20:00:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:24,722 INFO L93 Difference]: Finished difference Result 18642 states and 55401 transitions. [2019-12-18 20:00:24,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:00:24,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:00:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:24,753 INFO L225 Difference]: With dead ends: 18642 [2019-12-18 20:00:24,753 INFO L226 Difference]: Without dead ends: 18642 [2019-12-18 20:00:24,754 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:00:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18642 states. [2019-12-18 20:00:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18642 to 18642. [2019-12-18 20:00:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18642 states. [2019-12-18 20:00:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18642 states to 18642 states and 55401 transitions. [2019-12-18 20:00:25,033 INFO L78 Accepts]: Start accepts. Automaton has 18642 states and 55401 transitions. Word has length 39 [2019-12-18 20:00:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:25,033 INFO L462 AbstractCegarLoop]: Abstraction has 18642 states and 55401 transitions. [2019-12-18 20:00:25,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:00:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 18642 states and 55401 transitions. [2019-12-18 20:00:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:00:25,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:25,057 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] [2019-12-18 20:00:25,057 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:25,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:25,057 INFO L82 PathProgramCache]: Analyzing trace with hash -121906311, now seen corresponding path program 1 times [2019-12-18 20:00:25,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:25,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58929675] [2019-12-18 20:00:25,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:00:25,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58929675] [2019-12-18 20:00:25,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:25,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:00:25,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131101768] [2019-12-18 20:00:25,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:00:25,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:25,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:00:25,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:00:25,120 INFO L87 Difference]: Start difference. First operand 18642 states and 55401 transitions. Second operand 3 states. [2019-12-18 20:00:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:25,193 INFO L93 Difference]: Finished difference Result 18642 states and 54687 transitions. [2019-12-18 20:00:25,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:00:25,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 20:00:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:25,223 INFO L225 Difference]: With dead ends: 18642 [2019-12-18 20:00:25,223 INFO L226 Difference]: Without dead ends: 18642 [2019-12-18 20:00:25,224 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:00:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18642 states. [2019-12-18 20:00:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18642 to 18634. [2019-12-18 20:00:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18634 states. [2019-12-18 20:00:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18634 states to 18634 states and 54671 transitions. [2019-12-18 20:00:25,498 INFO L78 Accepts]: Start accepts. Automaton has 18634 states and 54671 transitions. Word has length 40 [2019-12-18 20:00:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:25,498 INFO L462 AbstractCegarLoop]: Abstraction has 18634 states and 54671 transitions. [2019-12-18 20:00:25,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:00:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 18634 states and 54671 transitions. [2019-12-18 20:00:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:00:25,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:25,519 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] [2019-12-18 20:00:25,519 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:25,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:25,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1092762268, now seen corresponding path program 1 times [2019-12-18 20:00:25,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:25,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842350704] [2019-12-18 20:00:25,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:25,597 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:00:25,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842350704] [2019-12-18 20:00:25,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:25,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:00:25,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946285625] [2019-12-18 20:00:25,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:00:25,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:25,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:00:25,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:00:25,599 INFO L87 Difference]: Start difference. First operand 18634 states and 54671 transitions. Second operand 3 states. [2019-12-18 20:00:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:25,687 INFO L93 Difference]: Finished difference Result 18634 states and 54594 transitions. [2019-12-18 20:00:25,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:00:25,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 20:00:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:25,725 INFO L225 Difference]: With dead ends: 18634 [2019-12-18 20:00:25,725 INFO L226 Difference]: Without dead ends: 18634 [2019-12-18 20:00:25,727 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:00:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18634 states. [2019-12-18 20:00:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18634 to 16452. [2019-12-18 20:00:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16452 states. [2019-12-18 20:00:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16452 states to 16452 states and 48592 transitions. [2019-12-18 20:00:26,302 INFO L78 Accepts]: Start accepts. Automaton has 16452 states and 48592 transitions. Word has length 41 [2019-12-18 20:00:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:26,303 INFO L462 AbstractCegarLoop]: Abstraction has 16452 states and 48592 transitions. [2019-12-18 20:00:26,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:00:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 16452 states and 48592 transitions. [2019-12-18 20:00:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:00:26,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:26,322 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:00:26,322 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 592584646, now seen corresponding path program 1 times [2019-12-18 20:00:26,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:26,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370270826] [2019-12-18 20:00:26,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:26,372 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:00:26,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370270826] [2019-12-18 20:00:26,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:26,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:00:26,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148160254] [2019-12-18 20:00:26,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:00:26,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:26,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:00:26,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:00:26,374 INFO L87 Difference]: Start difference. First operand 16452 states and 48592 transitions. Second operand 5 states. [2019-12-18 20:00:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:26,452 INFO L93 Difference]: Finished difference Result 15254 states and 46027 transitions. [2019-12-18 20:00:26,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:00:26,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 20:00:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:26,479 INFO L225 Difference]: With dead ends: 15254 [2019-12-18 20:00:26,479 INFO L226 Difference]: Without dead ends: 15254 [2019-12-18 20:00:26,479 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:00:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15254 states. [2019-12-18 20:00:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15254 to 15254. [2019-12-18 20:00:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15254 states. [2019-12-18 20:00:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15254 states to 15254 states and 46027 transitions. [2019-12-18 20:00:26,751 INFO L78 Accepts]: Start accepts. Automaton has 15254 states and 46027 transitions. Word has length 42 [2019-12-18 20:00:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:26,751 INFO L462 AbstractCegarLoop]: Abstraction has 15254 states and 46027 transitions. [2019-12-18 20:00:26,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:00:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 15254 states and 46027 transitions. [2019-12-18 20:00:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:00:26,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:26,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:26,768 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash -269656493, now seen corresponding path program 1 times [2019-12-18 20:00:26,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:26,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532623504] [2019-12-18 20:00:26,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:26,830 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:00:26,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532623504] [2019-12-18 20:00:26,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:26,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:00:26,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522236203] [2019-12-18 20:00:26,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:00:26,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:26,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:00:26,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:00:26,832 INFO L87 Difference]: Start difference. First operand 15254 states and 46027 transitions. Second operand 3 states. [2019-12-18 20:00:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:26,947 INFO L93 Difference]: Finished difference Result 17746 states and 53311 transitions. [2019-12-18 20:00:26,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:00:26,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:00:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:26,979 INFO L225 Difference]: With dead ends: 17746 [2019-12-18 20:00:26,979 INFO L226 Difference]: Without dead ends: 17746 [2019-12-18 20:00:26,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:00:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17746 states. [2019-12-18 20:00:27,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17746 to 14015. [2019-12-18 20:00:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14015 states. [2019-12-18 20:00:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14015 states to 14015 states and 42411 transitions. [2019-12-18 20:00:27,412 INFO L78 Accepts]: Start accepts. Automaton has 14015 states and 42411 transitions. Word has length 66 [2019-12-18 20:00:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:27,413 INFO L462 AbstractCegarLoop]: Abstraction has 14015 states and 42411 transitions. [2019-12-18 20:00:27,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:00:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 14015 states and 42411 transitions. [2019-12-18 20:00:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:00:27,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:27,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:27,440 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:27,441 INFO L82 PathProgramCache]: Analyzing trace with hash -466576635, now seen corresponding path program 1 times [2019-12-18 20:00:27,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:27,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564209354] [2019-12-18 20:00:27,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:00:27,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564209354] [2019-12-18 20:00:27,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:27,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:00:27,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137401899] [2019-12-18 20:00:27,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:00:27,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:27,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:00:27,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:00:27,697 INFO L87 Difference]: Start difference. First operand 14015 states and 42411 transitions. Second operand 10 states. [2019-12-18 20:00:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:29,196 INFO L93 Difference]: Finished difference Result 28354 states and 84996 transitions. [2019-12-18 20:00:29,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:00:29,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 20:00:29,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:29,225 INFO L225 Difference]: With dead ends: 28354 [2019-12-18 20:00:29,225 INFO L226 Difference]: Without dead ends: 19846 [2019-12-18 20:00:29,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:00:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19846 states. [2019-12-18 20:00:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19846 to 16545. [2019-12-18 20:00:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16545 states. [2019-12-18 20:00:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16545 states to 16545 states and 49685 transitions. [2019-12-18 20:00:29,516 INFO L78 Accepts]: Start accepts. Automaton has 16545 states and 49685 transitions. Word has length 67 [2019-12-18 20:00:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:29,516 INFO L462 AbstractCegarLoop]: Abstraction has 16545 states and 49685 transitions. [2019-12-18 20:00:29,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:00:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16545 states and 49685 transitions. [2019-12-18 20:00:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:00:29,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:29,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:29,534 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:29,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash -638378747, now seen corresponding path program 2 times [2019-12-18 20:00:29,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:29,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578502213] [2019-12-18 20:00:29,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:31,212 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 10 [2019-12-18 20:00:31,268 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:00:31,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578502213] [2019-12-18 20:00:31,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:31,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 20:00:31,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738026808] [2019-12-18 20:00:31,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 20:00:31,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 20:00:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-12-18 20:00:31,278 INFO L87 Difference]: Start difference. First operand 16545 states and 49685 transitions. Second operand 23 states. [2019-12-18 20:00:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:45,654 INFO L93 Difference]: Finished difference Result 31766 states and 90630 transitions. [2019-12-18 20:00:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-12-18 20:00:45,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-18 20:00:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:45,687 INFO L225 Difference]: With dead ends: 31766 [2019-12-18 20:00:45,688 INFO L226 Difference]: Without dead ends: 25930 [2019-12-18 20:00:45,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 9 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7571 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1877, Invalid=19003, Unknown=0, NotChecked=0, Total=20880 [2019-12-18 20:00:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25930 states. [2019-12-18 20:00:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25930 to 19531. [2019-12-18 20:00:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19531 states. [2019-12-18 20:00:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19531 states to 19531 states and 57570 transitions. [2019-12-18 20:00:46,020 INFO L78 Accepts]: Start accepts. Automaton has 19531 states and 57570 transitions. Word has length 67 [2019-12-18 20:00:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:46,020 INFO L462 AbstractCegarLoop]: Abstraction has 19531 states and 57570 transitions. [2019-12-18 20:00:46,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 20:00:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 19531 states and 57570 transitions. [2019-12-18 20:00:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:00:46,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:46,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:46,040 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:46,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1421599499, now seen corresponding path program 3 times [2019-12-18 20:00:46,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:46,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129694730] [2019-12-18 20:00:46,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:46,536 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:00:46,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129694730] [2019-12-18 20:00:46,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:46,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 20:00:46,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840826960] [2019-12-18 20:00:46,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 20:00:46,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:46,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 20:00:46,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:00:46,538 INFO L87 Difference]: Start difference. First operand 19531 states and 57570 transitions. Second operand 17 states. [2019-12-18 20:00:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:50,539 INFO L93 Difference]: Finished difference Result 25779 states and 74631 transitions. [2019-12-18 20:00:50,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 20:00:50,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 20:00:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:50,568 INFO L225 Difference]: With dead ends: 25779 [2019-12-18 20:00:50,568 INFO L226 Difference]: Without dead ends: 23240 [2019-12-18 20:00:50,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=362, Invalid=1800, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 20:00:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23240 states. [2019-12-18 20:00:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23240 to 19477. [2019-12-18 20:00:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19477 states. [2019-12-18 20:00:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19477 states to 19477 states and 57264 transitions. [2019-12-18 20:00:50,881 INFO L78 Accepts]: Start accepts. Automaton has 19477 states and 57264 transitions. Word has length 67 [2019-12-18 20:00:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:50,881 INFO L462 AbstractCegarLoop]: Abstraction has 19477 states and 57264 transitions. [2019-12-18 20:00:50,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 20:00:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 19477 states and 57264 transitions. [2019-12-18 20:00:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:00:50,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:50,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:50,902 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1948834343, now seen corresponding path program 4 times [2019-12-18 20:00:50,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:50,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846829529] [2019-12-18 20:00:50,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:51,175 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:00:51,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846829529] [2019-12-18 20:00:51,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:51,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:00:51,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577820898] [2019-12-18 20:00:51,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:00:51,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:51,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:00:51,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:00:51,177 INFO L87 Difference]: Start difference. First operand 19477 states and 57264 transitions. Second operand 11 states. [2019-12-18 20:00:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:52,982 INFO L93 Difference]: Finished difference Result 49038 states and 144922 transitions. [2019-12-18 20:00:52,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 20:00:52,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:00:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:53,025 INFO L225 Difference]: With dead ends: 49038 [2019-12-18 20:00:53,025 INFO L226 Difference]: Without dead ends: 33059 [2019-12-18 20:00:53,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 20:00:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33059 states. [2019-12-18 20:00:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33059 to 18453. [2019-12-18 20:00:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18453 states. [2019-12-18 20:00:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18453 states to 18453 states and 54814 transitions. [2019-12-18 20:00:53,405 INFO L78 Accepts]: Start accepts. Automaton has 18453 states and 54814 transitions. Word has length 67 [2019-12-18 20:00:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:53,405 INFO L462 AbstractCegarLoop]: Abstraction has 18453 states and 54814 transitions. [2019-12-18 20:00:53,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:00:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18453 states and 54814 transitions. [2019-12-18 20:00:53,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:00:53,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:53,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:53,424 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:53,425 INFO L82 PathProgramCache]: Analyzing trace with hash -376488081, now seen corresponding path program 5 times [2019-12-18 20:00:53,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:53,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480185848] [2019-12-18 20:00:53,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:00:53,678 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:00:53,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480185848] [2019-12-18 20:00:53,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:00:53,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:00:53,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318405020] [2019-12-18 20:00:53,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:00:53,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:00:53,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:00:53,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:00:53,680 INFO L87 Difference]: Start difference. First operand 18453 states and 54814 transitions. Second operand 12 states. [2019-12-18 20:00:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:00:55,116 INFO L93 Difference]: Finished difference Result 21857 states and 64239 transitions. [2019-12-18 20:00:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:00:55,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 20:00:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:00:55,145 INFO L225 Difference]: With dead ends: 21857 [2019-12-18 20:00:55,145 INFO L226 Difference]: Without dead ends: 21410 [2019-12-18 20:00:55,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2019-12-18 20:00:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21410 states. [2019-12-18 20:00:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21410 to 18205. [2019-12-18 20:00:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18205 states. [2019-12-18 20:00:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18205 states to 18205 states and 54190 transitions. [2019-12-18 20:00:55,697 INFO L78 Accepts]: Start accepts. Automaton has 18205 states and 54190 transitions. Word has length 67 [2019-12-18 20:00:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:00:55,697 INFO L462 AbstractCegarLoop]: Abstraction has 18205 states and 54190 transitions. [2019-12-18 20:00:55,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:00:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 18205 states and 54190 transitions. [2019-12-18 20:00:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:00:55,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:00:55,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:00:55,717 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:00:55,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:00:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1050036249, now seen corresponding path program 6 times [2019-12-18 20:00:55,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:00:55,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571380963] [2019-12-18 20:00:55,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:00:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:00:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:00:55,868 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:00:55,869 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:00:55,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~main$tmp_guard1~0_16 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t62~0.base_27| 1)) (= v_~z$r_buff0_thd3~0_79 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t62~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t62~0.base_27|) |v_ULTIMATE.start_main_~#t62~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_cnt~0_21) (= (select .cse0 |v_ULTIMATE.start_main_~#t62~0.base_27|) 0) (= v_~z$read_delayed~0_6 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$r_buff0_thd0~0_21 0) (= v_~z$w_buff0_used~0_112 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~x~0_10 0) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$r_buff1_thd0~0_23) (= 0 v_~z$w_buff1_used~0_70) (= 0 |v_ULTIMATE.start_main_~#t62~0.offset_19|) (= 0 v_~weak$$choice0~0_7) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t62~0.base_27| 4)) (= v_~__unbuffered_p2_EBX~0_15 0) (= v_~z~0_25 0) (= 0 |v_#NULL.base_7|) (= 0 v_~y~0_8) (= 0 v_~__unbuffered_p0_EAX~0_16) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t62~0.base_27|) (= 0 v_~z$r_buff1_thd3~0_47) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~z$r_buff0_thd2~0_21 0) (= v_~z$r_buff0_thd1~0_28 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t62~0.offset=|v_ULTIMATE.start_main_~#t62~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t64~0.base=|v_ULTIMATE.start_main_~#t64~0.base_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t63~0.base=|v_ULTIMATE.start_main_~#t63~0.base_24|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ULTIMATE.start_main_~#t64~0.offset=|v_ULTIMATE.start_main_~#t64~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t63~0.offset=|v_ULTIMATE.start_main_~#t63~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ULTIMATE.start_main_~#t62~0.base=|v_ULTIMATE.start_main_~#t62~0.base_27|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t62~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t64~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t63~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t64~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t63~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t62~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:00:55,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1472726663 0)) (= ~x~0_In1472726663 ~__unbuffered_p0_EAX~0_Out1472726663) (= ~z$r_buff1_thd3~0_Out1472726663 ~z$r_buff0_thd3~0_In1472726663) (= ~z$r_buff0_thd1~0_In1472726663 ~z$r_buff1_thd1~0_Out1472726663) (= ~z$r_buff1_thd2~0_Out1472726663 ~z$r_buff0_thd2~0_In1472726663) (= ~z$r_buff1_thd0~0_Out1472726663 ~z$r_buff0_thd0~0_In1472726663) (= ~z$r_buff0_thd1~0_Out1472726663 1)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1472726663, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1472726663, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1472726663, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1472726663, ~x~0=~x~0_In1472726663, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1472726663} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1472726663, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1472726663, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1472726663, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1472726663, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1472726663, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1472726663, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1472726663, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1472726663, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1472726663, ~x~0=~x~0_In1472726663, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1472726663} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:00:55,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L832-1-->L834: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t63~0.offset_10|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t63~0.base_11|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t63~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t63~0.base_11|) |v_ULTIMATE.start_main_~#t63~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t63~0.base_11| 1) |v_#valid_39|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t63~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t63~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t63~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t63~0.base=|v_ULTIMATE.start_main_~#t63~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t63~0.offset=|v_ULTIMATE.start_main_~#t63~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t63~0.base, ULTIMATE.start_main_~#t63~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 20:00:55,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L834-1-->L836: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t64~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t64~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t64~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t64~0.base_11|) |v_ULTIMATE.start_main_~#t64~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t64~0.base_11| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t64~0.base_11|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t64~0.base_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t64~0.base_11| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t64~0.base=|v_ULTIMATE.start_main_~#t64~0.base_11|, ULTIMATE.start_main_~#t64~0.offset=|v_ULTIMATE.start_main_~#t64~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t64~0.base, ULTIMATE.start_main_~#t64~0.offset, #length] because there is no mapped edge [2019-12-18 20:00:55,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-695874889| |P1Thread1of1ForFork2_#t~ite10_Out-695874889|)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-695874889 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-695874889 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-695874889| ~z~0_In-695874889) (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-695874889| ~z$w_buff1~0_In-695874889) .cse0 (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-695874889, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-695874889, ~z$w_buff1~0=~z$w_buff1~0_In-695874889, ~z~0=~z~0_In-695874889} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-695874889|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-695874889, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-695874889|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-695874889, ~z$w_buff1~0=~z$w_buff1~0_In-695874889, ~z~0=~z~0_In-695874889} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:00:55,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In817628387 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In817628387 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out817628387| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out817628387| ~z$w_buff0_used~0_In817628387)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In817628387, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In817628387} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In817628387, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out817628387|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In817628387} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:00:55,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2115415390 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2115415390 256)))) (or (and (= ~z$w_buff0_used~0_In2115415390 |P0Thread1of1ForFork1_#t~ite5_Out2115415390|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out2115415390|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2115415390, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2115415390} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2115415390|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2115415390, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2115415390} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:00:55,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1164980655 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1164980655 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1164980655 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1164980655 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1164980655| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out-1164980655| ~z$w_buff1_used~0_In-1164980655)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1164980655, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1164980655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164980655, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1164980655} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1164980655, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1164980655|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1164980655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164980655, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1164980655} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:00:55,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In2128292112 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2128292112 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out2128292112) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In2128292112 ~z$r_buff0_thd1~0_Out2128292112) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2128292112, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2128292112} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2128292112, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2128292112|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2128292112} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:00:55,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1619931178 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1619931178 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1619931178 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1619931178 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1619931178|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1619931178| ~z$r_buff1_thd1~0_In-1619931178) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619931178, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1619931178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1619931178, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1619931178} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1619931178|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619931178, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1619931178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1619931178, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1619931178} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:00:55,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-486977549 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-486977549 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-486977549 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-486977549 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-486977549| ~z$w_buff1_used~0_In-486977549) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-486977549| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-486977549, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-486977549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-486977549, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-486977549} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-486977549, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-486977549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-486977549, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-486977549|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-486977549} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:00:55,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1353527354 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1353527354 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1353527354|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-1353527354 |P1Thread1of1ForFork2_#t~ite13_Out-1353527354|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1353527354, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1353527354} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1353527354, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1353527354|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1353527354} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:00:55,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-1338408670 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1338408670 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1338408670 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1338408670 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1338408670|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1338408670 |P1Thread1of1ForFork2_#t~ite14_Out-1338408670|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1338408670, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1338408670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1338408670, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1338408670} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1338408670, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1338408670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1338408670, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1338408670|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1338408670} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:00:55,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L777-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 20:00:55,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:00:55,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1621785094 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In1621785094| |P2Thread1of1ForFork0_#t~ite29_Out1621785094|) (= ~z$w_buff1_used~0_In1621785094 |P2Thread1of1ForFork0_#t~ite30_Out1621785094|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1621785094 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1621785094 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1621785094 256) 0)) (and (= (mod ~z$r_buff1_thd3~0_In1621785094 256) 0) .cse1))) (= ~z$w_buff1_used~0_In1621785094 |P2Thread1of1ForFork0_#t~ite29_Out1621785094|) (= |P2Thread1of1ForFork0_#t~ite30_Out1621785094| |P2Thread1of1ForFork0_#t~ite29_Out1621785094|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1621785094, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1621785094, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1621785094, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1621785094, ~weak$$choice2~0=~weak$$choice2~0_In1621785094, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1621785094|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1621785094, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1621785094, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1621785094, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1621785094, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1621785094|, ~weak$$choice2~0=~weak$$choice2~0_In1621785094, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1621785094|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:00:55,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (= v_~z$r_buff0_thd3~0_51 v_~z$r_buff0_thd3~0_50) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:00:55,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 20:00:55,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1925719646 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1925719646 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-1925719646| ~z$w_buff1~0_In-1925719646) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1925719646| ~z~0_In-1925719646) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1925719646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1925719646, ~z$w_buff1~0=~z$w_buff1~0_In-1925719646, ~z~0=~z~0_In-1925719646} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1925719646|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1925719646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1925719646, ~z$w_buff1~0=~z$w_buff1~0_In-1925719646, ~z~0=~z~0_In-1925719646} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:00:55,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 20:00:55,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In960495854 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In960495854 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out960495854| ~z$w_buff0_used~0_In960495854)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out960495854|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In960495854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In960495854} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In960495854, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out960495854|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In960495854} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:00:55,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In401962050 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In401962050 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In401962050 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In401962050 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out401962050| ~z$w_buff1_used~0_In401962050) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out401962050| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In401962050, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In401962050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In401962050, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In401962050} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In401962050, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In401962050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In401962050, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In401962050, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out401962050|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:00:55,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-566454697 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-566454697 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-566454697| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-566454697| ~z$r_buff0_thd3~0_In-566454697) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-566454697, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-566454697} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-566454697, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-566454697, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-566454697|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:00:55,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1872581577 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1872581577 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1872581577 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1872581577 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1872581577|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In-1872581577 |P2Thread1of1ForFork0_#t~ite43_Out-1872581577|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1872581577, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1872581577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1872581577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1872581577} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1872581577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1872581577, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1872581577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1872581577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1872581577} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:00:55,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:00:55,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:00:55,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1025275538| |ULTIMATE.start_main_#t~ite48_Out1025275538|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1025275538 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1025275538 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In1025275538 |ULTIMATE.start_main_#t~ite47_Out1025275538|) (not .cse1) (not .cse2)) (and .cse0 (= ~z~0_In1025275538 |ULTIMATE.start_main_#t~ite47_Out1025275538|) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1025275538, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1025275538, ~z$w_buff1~0=~z$w_buff1~0_In1025275538, ~z~0=~z~0_In1025275538} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1025275538, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1025275538|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1025275538, ~z$w_buff1~0=~z$w_buff1~0_In1025275538, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1025275538|, ~z~0=~z~0_In1025275538} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 20:00:55,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1393508046 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1393508046 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1393508046| ~z$w_buff0_used~0_In-1393508046) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1393508046| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393508046, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393508046} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393508046, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393508046, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1393508046|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:00:55,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1995573988 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1995573988 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1995573988 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1995573988 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1995573988|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1995573988 |ULTIMATE.start_main_#t~ite50_Out-1995573988|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1995573988, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1995573988, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1995573988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1995573988} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1995573988|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1995573988, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1995573988, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1995573988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1995573988} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:00:55,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2136200763 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2136200763 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-2136200763|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-2136200763 |ULTIMATE.start_main_#t~ite51_Out-2136200763|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2136200763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136200763} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2136200763, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2136200763|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136200763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:00:55,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1121126203 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1121126203 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1121126203 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1121126203 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1121126203| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out1121126203| ~z$r_buff1_thd0~0_In1121126203) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1121126203, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1121126203, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1121126203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121126203} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1121126203|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1121126203, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1121126203, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1121126203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121126203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:00:55,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~z$r_buff1_thd0~0_16) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:00:56,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:00:56 BasicIcfg [2019-12-18 20:00:56,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:00:56,002 INFO L168 Benchmark]: Toolchain (without parser) took 109366.23 ms. Allocated memory was 136.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 99.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 20:00:56,002 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 20:00:56,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.93 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 153.9 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:00:56,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.49 ms. Allocated memory is still 200.8 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:00:56,004 INFO L168 Benchmark]: Boogie Preprocessor took 37.82 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:00:56,004 INFO L168 Benchmark]: RCFGBuilder took 974.39 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 98.3 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:00:56,005 INFO L168 Benchmark]: TraceAbstraction took 107455.53 ms. Allocated memory was 200.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 20:00:56,008 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.93 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 153.9 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.49 ms. Allocated memory is still 200.8 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.82 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 974.39 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 98.3 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107455.53 ms. Allocated memory was 200.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7190 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85139 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.1s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 41.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5505 SDtfs, 6301 SDslu, 19703 SDs, 0 SdLazy, 18493 SolverSat, 415 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 32 SyntacticMatches, 24 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8699 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155734occurred 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: 37.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 135790 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 861 ConstructedInterpolants, 0 QuantifiedInterpolants, 264315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...