/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/mix052_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:45:08,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:45:08,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:45:08,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:45:08,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:45:08,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:45:08,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:45:08,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:45:08,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:45:08,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:45:08,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:45:08,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:45:08,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:45:08,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:45:08,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:45:08,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:45:08,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:45:08,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:45:08,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:45:08,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:45:08,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:45:08,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:45:08,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:45:08,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:45:08,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:45:08,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:45:08,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:45:08,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:45:08,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:45:08,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:45:08,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:45:08,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:45:08,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:45:08,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:45:08,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:45:08,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:45:08,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:45:08,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:45:08,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:45:08,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:45:08,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:45:08,457 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 21:45:08,477 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:45:08,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:45:08,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:45:08,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:45:08,480 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:45:08,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:45:08,480 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:45:08,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:45:08,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:45:08,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:45:08,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:45:08,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:45:08,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:45:08,483 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:45:08,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:45:08,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:45:08,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:45:08,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:45:08,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:45:08,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:45:08,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:45:08,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:45:08,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:45:08,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:45:08,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:45:08,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:45:08,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:45:08,486 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:45:08,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:45:08,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:45:08,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:45:08,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:45:08,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:45:08,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:45:08,786 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:45:08,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-18 21:45:08,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fd938f7/12df5d617b1145f0b5df777b9dca57ef/FLAG3f6f6c8e1 [2019-12-18 21:45:09,461 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:45:09,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-18 21:45:09,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fd938f7/12df5d617b1145f0b5df777b9dca57ef/FLAG3f6f6c8e1 [2019-12-18 21:45:09,782 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fd938f7/12df5d617b1145f0b5df777b9dca57ef [2019-12-18 21:45:09,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:45:09,793 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:45:09,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:45:09,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:45:09,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:45:09,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:45:09" (1/1) ... [2019-12-18 21:45:09,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5245d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:09, skipping insertion in model container [2019-12-18 21:45:09,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:45:09" (1/1) ... [2019-12-18 21:45:09,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:45:09,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:45:10,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:45:10,460 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:45:10,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:45:10,624 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:45:10,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10 WrapperNode [2019-12-18 21:45:10,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:45:10,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:45:10,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:45:10,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:45:10,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (1/1) ... [2019-12-18 21:45:10,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (1/1) ... [2019-12-18 21:45:10,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:45:10,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:45:10,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:45:10,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:45:10,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (1/1) ... [2019-12-18 21:45:10,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (1/1) ... [2019-12-18 21:45:10,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (1/1) ... [2019-12-18 21:45:10,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (1/1) ... [2019-12-18 21:45:10,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (1/1) ... [2019-12-18 21:45:10,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (1/1) ... [2019-12-18 21:45:10,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (1/1) ... [2019-12-18 21:45:10,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:45:10,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:45:10,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:45:10,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:45:10,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (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 21:45:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:45:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:45:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:45:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:45:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:45:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:45:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:45:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:45:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:45:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:45:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:45:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:45:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:45:10,816 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 21:45:11,598 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:45:11,599 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:45:11,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:45:11 BoogieIcfgContainer [2019-12-18 21:45:11,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:45:11,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:45:11,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:45:11,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:45:11,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:45:09" (1/3) ... [2019-12-18 21:45:11,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ffdb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:45:11, skipping insertion in model container [2019-12-18 21:45:11,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:45:10" (2/3) ... [2019-12-18 21:45:11,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ffdb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:45:11, skipping insertion in model container [2019-12-18 21:45:11,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:45:11" (3/3) ... [2019-12-18 21:45:11,612 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.opt.i [2019-12-18 21:45:11,622 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:45:11,623 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:45:11,630 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:45:11,631 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:45:11,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,712 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,712 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,743 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,748 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,750 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:45:11,769 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:45:11,789 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:45:11,789 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:45:11,790 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:45:11,790 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:45:11,790 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:45:11,790 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:45:11,790 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:45:11,790 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:45:11,807 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 21:45:11,810 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 21:45:11,914 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 21:45:11,914 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:45:11,938 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:45:11,965 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 21:45:12,064 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 21:45:12,065 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:45:12,075 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:45:12,100 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:45:12,101 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:45:16,052 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 21:45:16,166 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 21:45:16,184 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-18 21:45:16,185 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 21:45:16,188 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-18 21:45:31,943 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-18 21:45:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-18 21:45:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:45:31,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:31,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:45:31,952 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 21:45:31,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-18 21:45:31,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:31,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094245054] [2019-12-18 21:45:31,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:32,198 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 21:45:32,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094245054] [2019-12-18 21:45:32,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:32,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:45:32,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807426858] [2019-12-18 21:45:32,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:45:32,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:32,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:45:32,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:45:32,218 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-18 21:45:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:35,605 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-18 21:45:35,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:45:35,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:45:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:36,219 INFO L225 Difference]: With dead ends: 106230 [2019-12-18 21:45:36,219 INFO L226 Difference]: Without dead ends: 99639 [2019-12-18 21:45:36,221 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 21:45:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-18 21:45:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-18 21:45:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-18 21:45:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-18 21:45:45,374 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-18 21:45:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:45:45,375 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-18 21:45:45,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:45:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-18 21:45:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:45:45,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:45:45,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:45:45,380 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 21:45:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:45:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-18 21:45:45,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:45:45,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334343136] [2019-12-18 21:45:45,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:45:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:45:45,522 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 21:45:45,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334343136] [2019-12-18 21:45:45,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:45:45,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:45:45,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103004222] [2019-12-18 21:45:45,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:45:45,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:45:45,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:45:45,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:45:45,527 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-18 21:45:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:45:50,655 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-18 21:45:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:45:50,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:45:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:45:51,302 INFO L225 Difference]: With dead ends: 159197 [2019-12-18 21:45:51,302 INFO L226 Difference]: Without dead ends: 159148 [2019-12-18 21:45:51,303 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 21:45:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-18 21:45:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-18 21:45:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-18 21:46:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-18 21:46:04,511 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-18 21:46:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:04,512 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-18 21:46:04,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-18 21:46:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:46:04,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:04,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:04,518 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 21:46:04,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:04,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-18 21:46:04,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:04,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652925312] [2019-12-18 21:46:04,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:04,587 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 21:46:04,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652925312] [2019-12-18 21:46:04,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:04,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:46:04,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239597958] [2019-12-18 21:46:04,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:46:04,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:04,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:46:04,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:04,590 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-18 21:46:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:04,726 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-18 21:46:04,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:46:04,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:46:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:04,827 INFO L225 Difference]: With dead ends: 32092 [2019-12-18 21:46:04,827 INFO L226 Difference]: Without dead ends: 32092 [2019-12-18 21:46:04,828 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 21:46:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-18 21:46:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-18 21:46:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-18 21:46:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-18 21:46:05,542 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-18 21:46:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:05,542 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-18 21:46:05,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:46:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-18 21:46:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:46:05,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:05,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:05,545 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 21:46:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-18 21:46:05,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:05,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228492141] [2019-12-18 21:46:05,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:05,662 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 21:46:05,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228492141] [2019-12-18 21:46:05,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:05,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:46:05,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061063193] [2019-12-18 21:46:05,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:46:05,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:05,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:46:05,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:46:05,664 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-18 21:46:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:07,388 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-18 21:46:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:46:07,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 21:46:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:07,512 INFO L225 Difference]: With dead ends: 43827 [2019-12-18 21:46:07,512 INFO L226 Difference]: Without dead ends: 43827 [2019-12-18 21:46:07,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-18 21:46:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-18 21:46:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-18 21:46:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-18 21:46:08,307 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-18 21:46:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:08,308 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-18 21:46:08,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:46:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-18 21:46:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:46:08,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:08,319 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 21:46:08,319 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 21:46:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-18 21:46:08,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:08,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196474130] [2019-12-18 21:46:08,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:08,520 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 21:46:08,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196474130] [2019-12-18 21:46:08,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:08,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:46:08,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138511164] [2019-12-18 21:46:08,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:46:08,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:46:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:46:08,523 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-18 21:46:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:09,564 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-18 21:46:09,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:46:09,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:46:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:09,695 INFO L225 Difference]: With dead ends: 56855 [2019-12-18 21:46:09,696 INFO L226 Difference]: Without dead ends: 56848 [2019-12-18 21:46:09,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:46:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-18 21:46:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-18 21:46:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-18 21:46:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-18 21:46:11,226 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-18 21:46:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:11,227 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-18 21:46:11,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:46:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-18 21:46:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:46:11,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:11,241 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 21:46:11,242 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 21:46:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-18 21:46:11,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:11,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677243952] [2019-12-18 21:46:11,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:11,301 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 21:46:11,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677243952] [2019-12-18 21:46:11,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:11,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:46:11,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985545570] [2019-12-18 21:46:11,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:46:11,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:11,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:46:11,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:46:11,303 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-18 21:46:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:11,370 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-18 21:46:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:46:11,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:46:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:11,392 INFO L225 Difference]: With dead ends: 15569 [2019-12-18 21:46:11,392 INFO L226 Difference]: Without dead ends: 15569 [2019-12-18 21:46:11,392 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 21:46:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-18 21:46:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-18 21:46:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-18 21:46:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-18 21:46:11,619 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-18 21:46:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:11,619 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-18 21:46:11,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-18 21:46:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:46:11,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:11,632 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 21:46:11,632 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 21:46:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-18 21:46:11,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:11,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370418580] [2019-12-18 21:46:11,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:11,741 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 21:46:11,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370418580] [2019-12-18 21:46:11,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:11,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:46:11,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630623333] [2019-12-18 21:46:11,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:46:11,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:11,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:46:11,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:46:11,744 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-18 21:46:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:12,361 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-18 21:46:12,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:46:12,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:46:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:12,408 INFO L225 Difference]: With dead ends: 21967 [2019-12-18 21:46:12,409 INFO L226 Difference]: Without dead ends: 21967 [2019-12-18 21:46:12,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:46:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-18 21:46:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-18 21:46:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-18 21:46:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-18 21:46:12,756 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-18 21:46:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:12,756 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-18 21:46:12,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:46:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-18 21:46:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:46:12,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:12,775 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 21:46:12,775 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 21:46:12,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:12,775 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-18 21:46:12,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:12,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254296286] [2019-12-18 21:46:12,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:12,939 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 21:46:12,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254296286] [2019-12-18 21:46:12,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:12,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:46:12,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524456842] [2019-12-18 21:46:12,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:12,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:12,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:12,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:12,942 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-18 21:46:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:14,846 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-18 21:46:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:46:14,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:46:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:14,881 INFO L225 Difference]: With dead ends: 24877 [2019-12-18 21:46:14,881 INFO L226 Difference]: Without dead ends: 24877 [2019-12-18 21:46:14,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:46:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-18 21:46:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-18 21:46:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-18 21:46:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-18 21:46:15,172 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-18 21:46:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:15,172 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-18 21:46:15,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-18 21:46:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:46:15,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:15,196 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 21:46:15,196 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 21:46:15,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:15,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-18 21:46:15,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:15,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186716440] [2019-12-18 21:46:15,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:15,285 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 21:46:15,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186716440] [2019-12-18 21:46:15,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:15,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:46:15,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454199524] [2019-12-18 21:46:15,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:46:15,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:46:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:46:15,288 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 5 states. [2019-12-18 21:46:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:15,948 INFO L93 Difference]: Finished difference Result 23664 states and 70656 transitions. [2019-12-18 21:46:15,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:46:15,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:46:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:15,982 INFO L225 Difference]: With dead ends: 23664 [2019-12-18 21:46:15,983 INFO L226 Difference]: Without dead ends: 23664 [2019-12-18 21:46:15,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:46:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23664 states. [2019-12-18 21:46:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23664 to 22129. [2019-12-18 21:46:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22129 states. [2019-12-18 21:46:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22129 states to 22129 states and 66460 transitions. [2019-12-18 21:46:16,318 INFO L78 Accepts]: Start accepts. Automaton has 22129 states and 66460 transitions. Word has length 39 [2019-12-18 21:46:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:16,318 INFO L462 AbstractCegarLoop]: Abstraction has 22129 states and 66460 transitions. [2019-12-18 21:46:16,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:46:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22129 states and 66460 transitions. [2019-12-18 21:46:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:46:16,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:16,347 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 21:46:16,348 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 21:46:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1240175328, now seen corresponding path program 2 times [2019-12-18 21:46:16,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:16,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660260877] [2019-12-18 21:46:16,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:16,404 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 21:46:16,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660260877] [2019-12-18 21:46:16,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:16,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:46:16,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555432315] [2019-12-18 21:46:16,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:46:16,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:16,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:46:16,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:46:16,406 INFO L87 Difference]: Start difference. First operand 22129 states and 66460 transitions. Second operand 5 states. [2019-12-18 21:46:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:16,500 INFO L93 Difference]: Finished difference Result 20882 states and 63572 transitions. [2019-12-18 21:46:16,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:46:16,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:46:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:16,529 INFO L225 Difference]: With dead ends: 20882 [2019-12-18 21:46:16,530 INFO L226 Difference]: Without dead ends: 20882 [2019-12-18 21:46:16,530 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 21:46:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20882 states. [2019-12-18 21:46:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20882 to 20042. [2019-12-18 21:46:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20042 states. [2019-12-18 21:46:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20042 states to 20042 states and 61305 transitions. [2019-12-18 21:46:16,830 INFO L78 Accepts]: Start accepts. Automaton has 20042 states and 61305 transitions. Word has length 39 [2019-12-18 21:46:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:16,830 INFO L462 AbstractCegarLoop]: Abstraction has 20042 states and 61305 transitions. [2019-12-18 21:46:16,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:46:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 20042 states and 61305 transitions. [2019-12-18 21:46:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:46:16,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:16,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:16,853 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 21:46:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash 480370435, now seen corresponding path program 1 times [2019-12-18 21:46:16,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:16,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534616732] [2019-12-18 21:46:16,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:46:16,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534616732] [2019-12-18 21:46:16,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:16,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:46:16,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804690263] [2019-12-18 21:46:16,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:46:16,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:16,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:46:16,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:16,911 INFO L87 Difference]: Start difference. First operand 20042 states and 61305 transitions. Second operand 3 states. [2019-12-18 21:46:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:17,045 INFO L93 Difference]: Finished difference Result 29777 states and 91217 transitions. [2019-12-18 21:46:17,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:46:17,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 21:46:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:17,085 INFO L225 Difference]: With dead ends: 29777 [2019-12-18 21:46:17,085 INFO L226 Difference]: Without dead ends: 29777 [2019-12-18 21:46:17,087 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 21:46:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29777 states. [2019-12-18 21:46:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29777 to 22663. [2019-12-18 21:46:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22663 states. [2019-12-18 21:46:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22663 states to 22663 states and 70163 transitions. [2019-12-18 21:46:18,062 INFO L78 Accepts]: Start accepts. Automaton has 22663 states and 70163 transitions. Word has length 64 [2019-12-18 21:46:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:18,062 INFO L462 AbstractCegarLoop]: Abstraction has 22663 states and 70163 transitions. [2019-12-18 21:46:18,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:46:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 22663 states and 70163 transitions. [2019-12-18 21:46:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:46:18,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:18,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:18,092 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 21:46:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2036276616, now seen corresponding path program 1 times [2019-12-18 21:46:18,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:18,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370484051] [2019-12-18 21:46:18,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:18,159 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 21:46:18,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370484051] [2019-12-18 21:46:18,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:18,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:46:18,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48396033] [2019-12-18 21:46:18,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:46:18,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:46:18,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:46:18,163 INFO L87 Difference]: Start difference. First operand 22663 states and 70163 transitions. Second operand 4 states. [2019-12-18 21:46:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:18,337 INFO L93 Difference]: Finished difference Result 42597 states and 132112 transitions. [2019-12-18 21:46:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:46:18,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-18 21:46:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:18,380 INFO L225 Difference]: With dead ends: 42597 [2019-12-18 21:46:18,380 INFO L226 Difference]: Without dead ends: 21217 [2019-12-18 21:46:18,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:46:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21217 states. [2019-12-18 21:46:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21217 to 21217. [2019-12-18 21:46:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-18 21:46:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-18 21:46:18,707 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-18 21:46:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:18,708 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-18 21:46:18,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-18 21:46:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:46:18,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:18,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:18,740 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 21:46:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:18,740 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 2 times [2019-12-18 21:46:18,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:18,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670103364] [2019-12-18 21:46:18,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:18,825 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 21:46:18,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670103364] [2019-12-18 21:46:18,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:18,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:46:18,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100206729] [2019-12-18 21:46:18,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:18,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:18,828 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 7 states. [2019-12-18 21:46:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:19,363 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-18 21:46:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:46:19,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:46:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:19,427 INFO L225 Difference]: With dead ends: 62594 [2019-12-18 21:46:19,427 INFO L226 Difference]: Without dead ends: 42982 [2019-12-18 21:46:19,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:46:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-18 21:46:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-18 21:46:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-18 21:46:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-18 21:46:20,767 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-18 21:46:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:20,768 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-18 21:46:20,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-18 21:46:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:46:20,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:20,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:20,797 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 21:46:20,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:20,797 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 3 times [2019-12-18 21:46:20,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:20,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553990285] [2019-12-18 21:46:20,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:20,884 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 21:46:20,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553990285] [2019-12-18 21:46:20,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:20,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:46:20,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379924653] [2019-12-18 21:46:20,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:20,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:20,887 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 7 states. [2019-12-18 21:46:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:21,528 INFO L93 Difference]: Finished difference Result 70069 states and 215496 transitions. [2019-12-18 21:46:21,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:46:21,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:46:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:21,646 INFO L225 Difference]: With dead ends: 70069 [2019-12-18 21:46:21,647 INFO L226 Difference]: Without dead ends: 52756 [2019-12-18 21:46:21,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:46:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52756 states. [2019-12-18 21:46:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52756 to 28331. [2019-12-18 21:46:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-18 21:46:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-18 21:46:22,264 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-18 21:46:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:22,264 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-18 21:46:22,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-18 21:46:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:46:22,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:22,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:22,294 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 21:46:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:22,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 4 times [2019-12-18 21:46:22,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:22,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644953002] [2019-12-18 21:46:22,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:22,378 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 21:46:22,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644953002] [2019-12-18 21:46:22,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:22,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:46:22,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756818771] [2019-12-18 21:46:22,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:22,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:22,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:22,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:22,380 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 7 states. [2019-12-18 21:46:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:22,963 INFO L93 Difference]: Finished difference Result 60139 states and 184623 transitions. [2019-12-18 21:46:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:46:22,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:46:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:23,056 INFO L225 Difference]: With dead ends: 60139 [2019-12-18 21:46:23,056 INFO L226 Difference]: Without dead ends: 52780 [2019-12-18 21:46:23,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:46:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52780 states. [2019-12-18 21:46:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52780 to 28639. [2019-12-18 21:46:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-18 21:46:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-18 21:46:24,367 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-18 21:46:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:24,367 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-18 21:46:24,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-18 21:46:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:46:24,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:24,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:24,397 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 21:46:24,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:24,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 5 times [2019-12-18 21:46:24,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:24,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547036108] [2019-12-18 21:46:24,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:24,450 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 21:46:24,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547036108] [2019-12-18 21:46:24,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:24,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:46:24,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584007938] [2019-12-18 21:46:24,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:46:24,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:24,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:46:24,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:24,452 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-18 21:46:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:24,643 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-18 21:46:24,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:46:24,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 21:46:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:24,711 INFO L225 Difference]: With dead ends: 34404 [2019-12-18 21:46:24,711 INFO L226 Difference]: Without dead ends: 34404 [2019-12-18 21:46:24,712 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 21:46:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-18 21:46:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-18 21:46:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-18 21:46:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-18 21:46:25,202 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-18 21:46:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:25,203 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-18 21:46:25,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:46:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-18 21:46:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:25,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:25,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:25,237 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 21:46:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-18 21:46:25,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:25,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429124707] [2019-12-18 21:46:25,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:46:25,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429124707] [2019-12-18 21:46:25,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:25,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:46:25,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913778628] [2019-12-18 21:46:25,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:46:25,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:46:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:46:25,307 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-18 21:46:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:25,587 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-18 21:46:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:46:25,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:46:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:25,642 INFO L225 Difference]: With dead ends: 38058 [2019-12-18 21:46:25,642 INFO L226 Difference]: Without dead ends: 38058 [2019-12-18 21:46:25,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:46:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-18 21:46:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-18 21:46:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-18 21:46:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-18 21:46:27,752 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-18 21:46:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:27,752 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-18 21:46:27,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-18 21:46:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:27,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:27,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:27,785 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 21:46:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:27,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-18 21:46:27,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:27,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964845197] [2019-12-18 21:46:27,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:27,833 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 21:46:27,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964845197] [2019-12-18 21:46:27,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:27,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:46:27,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336839586] [2019-12-18 21:46:27,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:46:27,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:46:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:46:27,840 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-18 21:46:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:28,211 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-18 21:46:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:46:28,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:46:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:28,286 INFO L225 Difference]: With dead ends: 48141 [2019-12-18 21:46:28,286 INFO L226 Difference]: Without dead ends: 48141 [2019-12-18 21:46:28,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 21:46:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-18 21:46:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-18 21:46:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-18 21:46:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-18 21:46:28,927 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-18 21:46:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:28,927 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-18 21:46:28,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-18 21:46:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:28,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:28,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:28,988 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 21:46:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-18 21:46:28,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:28,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014973180] [2019-12-18 21:46:28,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:29,412 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 21:46:29,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014973180] [2019-12-18 21:46:29,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:29,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:46:29,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633771336] [2019-12-18 21:46:29,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:29,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:29,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:29,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:29,415 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-18 21:46:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:29,992 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-18 21:46:29,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:46:29,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:46:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:30,100 INFO L225 Difference]: With dead ends: 72421 [2019-12-18 21:46:30,100 INFO L226 Difference]: Without dead ends: 66202 [2019-12-18 21:46:30,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:46:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-18 21:46:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-18 21:46:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-18 21:46:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-18 21:46:30,848 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-18 21:46:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:30,849 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-18 21:46:30,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-18 21:46:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:30,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:30,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:30,886 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 21:46:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-18 21:46:30,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:30,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28329114] [2019-12-18 21:46:30,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:30,988 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 21:46:30,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28329114] [2019-12-18 21:46:30,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:30,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:46:30,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649738322] [2019-12-18 21:46:30,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:46:30,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:46:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:30,990 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 7 states. [2019-12-18 21:46:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:31,675 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-18 21:46:31,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:46:31,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:46:31,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:31,763 INFO L225 Difference]: With dead ends: 53845 [2019-12-18 21:46:31,763 INFO L226 Difference]: Without dead ends: 53845 [2019-12-18 21:46:31,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:46:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-18 21:46:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-18 21:46:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-18 21:46:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-18 21:46:32,787 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-18 21:46:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:32,787 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-18 21:46:32,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:46:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-18 21:46:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:32,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:32,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:32,828 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 21:46:32,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:32,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-18 21:46:32,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:32,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997637226] [2019-12-18 21:46:32,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:32,894 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 21:46:32,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997637226] [2019-12-18 21:46:32,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:32,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:46:32,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503635713] [2019-12-18 21:46:32,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:46:32,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:32,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:46:32,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:46:32,896 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-18 21:46:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:33,566 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-18 21:46:33,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:46:33,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 21:46:33,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:33,643 INFO L225 Difference]: With dead ends: 49777 [2019-12-18 21:46:33,644 INFO L226 Difference]: Without dead ends: 49557 [2019-12-18 21:46:33,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:46:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-18 21:46:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-18 21:46:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-18 21:46:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-18 21:46:34,836 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-18 21:46:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:34,836 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-18 21:46:34,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:46:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-18 21:46:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:46:34,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:34,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:34,880 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 21:46:34,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:34,880 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-18 21:46:34,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:34,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596438331] [2019-12-18 21:46:34,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:34,932 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 21:46:34,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596438331] [2019-12-18 21:46:34,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:34,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:46:34,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532847690] [2019-12-18 21:46:34,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:46:34,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:34,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:46:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:34,936 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 3 states. [2019-12-18 21:46:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:35,076 INFO L93 Difference]: Finished difference Result 39728 states and 124202 transitions. [2019-12-18 21:46:35,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:46:35,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:46:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:35,137 INFO L225 Difference]: With dead ends: 39728 [2019-12-18 21:46:35,137 INFO L226 Difference]: Without dead ends: 39728 [2019-12-18 21:46:35,138 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 21:46:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39728 states. [2019-12-18 21:46:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39728 to 34470. [2019-12-18 21:46:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34470 states. [2019-12-18 21:46:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34470 states to 34470 states and 109241 transitions. [2019-12-18 21:46:35,734 INFO L78 Accepts]: Start accepts. Automaton has 34470 states and 109241 transitions. Word has length 65 [2019-12-18 21:46:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:35,734 INFO L462 AbstractCegarLoop]: Abstraction has 34470 states and 109241 transitions. [2019-12-18 21:46:35,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:46:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 34470 states and 109241 transitions. [2019-12-18 21:46:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:46:35,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:35,773 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 21:46:35,773 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 21:46:35,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:35,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1323575748, now seen corresponding path program 1 times [2019-12-18 21:46:35,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:35,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616248354] [2019-12-18 21:46:35,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:35,838 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 21:46:35,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616248354] [2019-12-18 21:46:35,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:35,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:46:35,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754052855] [2019-12-18 21:46:35,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:46:35,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:35,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:46:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:46:35,841 INFO L87 Difference]: Start difference. First operand 34470 states and 109241 transitions. Second operand 3 states. [2019-12-18 21:46:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:35,958 INFO L93 Difference]: Finished difference Result 25986 states and 81015 transitions. [2019-12-18 21:46:35,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:46:35,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:46:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:36,010 INFO L225 Difference]: With dead ends: 25986 [2019-12-18 21:46:36,010 INFO L226 Difference]: Without dead ends: 25986 [2019-12-18 21:46:36,011 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 21:46:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25986 states. [2019-12-18 21:46:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25986 to 24663. [2019-12-18 21:46:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24663 states. [2019-12-18 21:46:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24663 states to 24663 states and 76821 transitions. [2019-12-18 21:46:36,399 INFO L78 Accepts]: Start accepts. Automaton has 24663 states and 76821 transitions. Word has length 66 [2019-12-18 21:46:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:36,401 INFO L462 AbstractCegarLoop]: Abstraction has 24663 states and 76821 transitions. [2019-12-18 21:46:36,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:46:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24663 states and 76821 transitions. [2019-12-18 21:46:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:46:36,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:36,434 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 21:46:36,435 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 21:46:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1781917276, now seen corresponding path program 1 times [2019-12-18 21:46:36,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:36,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686772631] [2019-12-18 21:46:36,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:36,498 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 21:46:36,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686772631] [2019-12-18 21:46:36,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:36,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:46:36,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571171701] [2019-12-18 21:46:36,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:46:36,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:36,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:46:36,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:46:36,500 INFO L87 Difference]: Start difference. First operand 24663 states and 76821 transitions. Second operand 4 states. [2019-12-18 21:46:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:36,931 INFO L93 Difference]: Finished difference Result 24663 states and 76613 transitions. [2019-12-18 21:46:36,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:46:36,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-18 21:46:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:36,980 INFO L225 Difference]: With dead ends: 24663 [2019-12-18 21:46:36,980 INFO L226 Difference]: Without dead ends: 24663 [2019-12-18 21:46:36,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 21:46:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24663 states. [2019-12-18 21:46:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24663 to 19887. [2019-12-18 21:46:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19887 states. [2019-12-18 21:46:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19887 states to 19887 states and 61257 transitions. [2019-12-18 21:46:37,312 INFO L78 Accepts]: Start accepts. Automaton has 19887 states and 61257 transitions. Word has length 67 [2019-12-18 21:46:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:37,312 INFO L462 AbstractCegarLoop]: Abstraction has 19887 states and 61257 transitions. [2019-12-18 21:46:37,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:46:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 19887 states and 61257 transitions. [2019-12-18 21:46:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:46:37,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:37,334 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 21:46:37,334 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 21:46:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:37,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-18 21:46:37,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:37,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338735455] [2019-12-18 21:46:37,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:37,782 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 21:46:37,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338735455] [2019-12-18 21:46:37,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:37,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:46:37,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129562636] [2019-12-18 21:46:37,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:46:37,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:37,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:46:37,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:46:37,784 INFO L87 Difference]: Start difference. First operand 19887 states and 61257 transitions. Second operand 15 states. [2019-12-18 21:46:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:42,612 INFO L93 Difference]: Finished difference Result 44082 states and 134052 transitions. [2019-12-18 21:46:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 21:46:42,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 21:46:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:42,668 INFO L225 Difference]: With dead ends: 44082 [2019-12-18 21:46:42,668 INFO L226 Difference]: Without dead ends: 37288 [2019-12-18 21:46:42,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=620, Invalid=3412, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 21:46:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37288 states. [2019-12-18 21:46:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37288 to 20597. [2019-12-18 21:46:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20597 states. [2019-12-18 21:46:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20597 states to 20597 states and 63113 transitions. [2019-12-18 21:46:43,357 INFO L78 Accepts]: Start accepts. Automaton has 20597 states and 63113 transitions. Word has length 67 [2019-12-18 21:46:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:43,357 INFO L462 AbstractCegarLoop]: Abstraction has 20597 states and 63113 transitions. [2019-12-18 21:46:43,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:46:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 20597 states and 63113 transitions. [2019-12-18 21:46:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:46:43,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:43,377 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 21:46:43,377 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 21:46:43,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:43,378 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 2 times [2019-12-18 21:46:43,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:43,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271253594] [2019-12-18 21:46:43,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:43,820 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 21:46:43,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271253594] [2019-12-18 21:46:43,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:43,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:46:43,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92297413] [2019-12-18 21:46:43,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:46:43,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:43,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:46:43,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:46:43,823 INFO L87 Difference]: Start difference. First operand 20597 states and 63113 transitions. Second operand 15 states. [2019-12-18 21:46:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:48,744 INFO L93 Difference]: Finished difference Result 37581 states and 113848 transitions. [2019-12-18 21:46:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 21:46:48,744 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 21:46:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:48,797 INFO L225 Difference]: With dead ends: 37581 [2019-12-18 21:46:48,798 INFO L226 Difference]: Without dead ends: 37222 [2019-12-18 21:46:48,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 21:46:48,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37222 states. [2019-12-18 21:46:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37222 to 20357. [2019-12-18 21:46:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20357 states. [2019-12-18 21:46:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20357 states to 20357 states and 62445 transitions. [2019-12-18 21:46:49,199 INFO L78 Accepts]: Start accepts. Automaton has 20357 states and 62445 transitions. Word has length 67 [2019-12-18 21:46:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:49,200 INFO L462 AbstractCegarLoop]: Abstraction has 20357 states and 62445 transitions. [2019-12-18 21:46:49,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:46:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 20357 states and 62445 transitions. [2019-12-18 21:46:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:46:49,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:49,219 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 21:46:49,219 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:49,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:49,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1579837296, now seen corresponding path program 3 times [2019-12-18 21:46:49,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:49,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528989302] [2019-12-18 21:46:49,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:50,216 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 21:46:50,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528989302] [2019-12-18 21:46:50,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:50,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:46:50,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756287677] [2019-12-18 21:46:50,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:46:50,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:46:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:46:50,217 INFO L87 Difference]: Start difference. First operand 20357 states and 62445 transitions. Second operand 18 states. [2019-12-18 21:46:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:46:55,562 INFO L93 Difference]: Finished difference Result 31663 states and 95833 transitions. [2019-12-18 21:46:55,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-18 21:46:55,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 21:46:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:46:55,607 INFO L225 Difference]: With dead ends: 31663 [2019-12-18 21:46:55,607 INFO L226 Difference]: Without dead ends: 27752 [2019-12-18 21:46:55,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=606, Invalid=3300, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 21:46:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27752 states. [2019-12-18 21:46:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27752 to 20703. [2019-12-18 21:46:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20703 states. [2019-12-18 21:46:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20703 states to 20703 states and 63374 transitions. [2019-12-18 21:46:55,966 INFO L78 Accepts]: Start accepts. Automaton has 20703 states and 63374 transitions. Word has length 67 [2019-12-18 21:46:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:46:55,966 INFO L462 AbstractCegarLoop]: Abstraction has 20703 states and 63374 transitions. [2019-12-18 21:46:55,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:46:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20703 states and 63374 transitions. [2019-12-18 21:46:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:46:55,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:46:55,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:46:55,988 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:46:55,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:46:55,988 INFO L82 PathProgramCache]: Analyzing trace with hash 410126632, now seen corresponding path program 4 times [2019-12-18 21:46:55,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:46:55,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591293178] [2019-12-18 21:46:55,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:46:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:46:56,348 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 21:46:56,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591293178] [2019-12-18 21:46:56,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:46:56,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:46:56,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412849898] [2019-12-18 21:46:56,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:46:56,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:46:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:46:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:46:56,350 INFO L87 Difference]: Start difference. First operand 20703 states and 63374 transitions. Second operand 15 states. [2019-12-18 21:47:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:47:02,630 INFO L93 Difference]: Finished difference Result 50696 states and 154381 transitions. [2019-12-18 21:47:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 21:47:02,631 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 21:47:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:47:02,702 INFO L225 Difference]: With dead ends: 50696 [2019-12-18 21:47:02,702 INFO L226 Difference]: Without dead ends: 48481 [2019-12-18 21:47:02,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 21:47:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48481 states. [2019-12-18 21:47:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48481 to 25831. [2019-12-18 21:47:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25831 states. [2019-12-18 21:47:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25831 states to 25831 states and 79473 transitions. [2019-12-18 21:47:03,273 INFO L78 Accepts]: Start accepts. Automaton has 25831 states and 79473 transitions. Word has length 67 [2019-12-18 21:47:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:47:03,273 INFO L462 AbstractCegarLoop]: Abstraction has 25831 states and 79473 transitions. [2019-12-18 21:47:03,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:47:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 25831 states and 79473 transitions. [2019-12-18 21:47:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:47:03,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:47:03,302 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 21:47:03,302 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:47:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:47:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash -966767814, now seen corresponding path program 5 times [2019-12-18 21:47:03,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:47:03,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950374134] [2019-12-18 21:47:03,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:47:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:47:03,794 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 21:47:03,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950374134] [2019-12-18 21:47:03,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:47:03,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:47:03,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98179502] [2019-12-18 21:47:03,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:47:03,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:47:03,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:47:03,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:47:03,797 INFO L87 Difference]: Start difference. First operand 25831 states and 79473 transitions. Second operand 15 states. [2019-12-18 21:47:05,466 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-12-18 21:47:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:47:08,566 INFO L93 Difference]: Finished difference Result 49340 states and 149593 transitions. [2019-12-18 21:47:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 21:47:08,567 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 21:47:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:47:08,621 INFO L225 Difference]: With dead ends: 49340 [2019-12-18 21:47:08,621 INFO L226 Difference]: Without dead ends: 38012 [2019-12-18 21:47:08,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 21:47:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38012 states. [2019-12-18 21:47:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38012 to 20453. [2019-12-18 21:47:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20453 states. [2019-12-18 21:47:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20453 states to 20453 states and 62497 transitions. [2019-12-18 21:47:09,031 INFO L78 Accepts]: Start accepts. Automaton has 20453 states and 62497 transitions. Word has length 67 [2019-12-18 21:47:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:47:09,031 INFO L462 AbstractCegarLoop]: Abstraction has 20453 states and 62497 transitions. [2019-12-18 21:47:09,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:47:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 20453 states and 62497 transitions. [2019-12-18 21:47:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:47:09,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:47:09,050 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 21:47:09,051 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:47:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:47:09,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2122626696, now seen corresponding path program 6 times [2019-12-18 21:47:09,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:47:09,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543380195] [2019-12-18 21:47:09,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:47:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:47:09,703 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 21:47:09,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543380195] [2019-12-18 21:47:09,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:47:09,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 21:47:09,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985096177] [2019-12-18 21:47:09,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 21:47:09,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:47:09,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 21:47:09,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:47:09,705 INFO L87 Difference]: Start difference. First operand 20453 states and 62497 transitions. Second operand 20 states. [2019-12-18 21:47:16,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:47:16,116 INFO L93 Difference]: Finished difference Result 29218 states and 87616 transitions. [2019-12-18 21:47:16,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 21:47:16,117 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 21:47:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:47:16,157 INFO L225 Difference]: With dead ends: 29218 [2019-12-18 21:47:16,157 INFO L226 Difference]: Without dead ends: 28101 [2019-12-18 21:47:16,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=542, Invalid=2998, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 21:47:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28101 states. [2019-12-18 21:47:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28101 to 20808. [2019-12-18 21:47:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20808 states. [2019-12-18 21:47:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20808 states to 20808 states and 63466 transitions. [2019-12-18 21:47:16,498 INFO L78 Accepts]: Start accepts. Automaton has 20808 states and 63466 transitions. Word has length 67 [2019-12-18 21:47:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:47:16,498 INFO L462 AbstractCegarLoop]: Abstraction has 20808 states and 63466 transitions. [2019-12-18 21:47:16,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 21:47:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 20808 states and 63466 transitions. [2019-12-18 21:47:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:47:16,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:47:16,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, 1, 1, 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 21:47:16,519 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:47:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:47:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash 40207360, now seen corresponding path program 7 times [2019-12-18 21:47:16,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:47:16,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053621023] [2019-12-18 21:47:16,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:47:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:47:17,245 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 21:47:17,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053621023] [2019-12-18 21:47:17,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:47:17,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 21:47:17,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804642689] [2019-12-18 21:47:17,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 21:47:17,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:47:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 21:47:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:47:17,247 INFO L87 Difference]: Start difference. First operand 20808 states and 63466 transitions. Second operand 20 states. [2019-12-18 21:47:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:47:21,438 INFO L93 Difference]: Finished difference Result 28315 states and 85231 transitions. [2019-12-18 21:47:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 21:47:21,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 21:47:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:47:21,478 INFO L225 Difference]: With dead ends: 28315 [2019-12-18 21:47:21,478 INFO L226 Difference]: Without dead ends: 27208 [2019-12-18 21:47:21,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=419, Invalid=2131, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 21:47:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27208 states. [2019-12-18 21:47:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27208 to 20824. [2019-12-18 21:47:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20824 states. [2019-12-18 21:47:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20824 states to 20824 states and 63498 transitions. [2019-12-18 21:47:22,157 INFO L78 Accepts]: Start accepts. Automaton has 20824 states and 63498 transitions. Word has length 67 [2019-12-18 21:47:22,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:47:22,157 INFO L462 AbstractCegarLoop]: Abstraction has 20824 states and 63498 transitions. [2019-12-18 21:47:22,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 21:47:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 20824 states and 63498 transitions. [2019-12-18 21:47:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:47:22,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:47:22,178 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 21:47:22,178 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:47:22,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:47:22,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1036353856, now seen corresponding path program 8 times [2019-12-18 21:47:22,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:47:22,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515760984] [2019-12-18 21:47:22,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:47:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:47:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:47:22,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515760984] [2019-12-18 21:47:22,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:47:22,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:47:22,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484482841] [2019-12-18 21:47:22,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:47:22,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:47:22,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:47:22,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:47:22,625 INFO L87 Difference]: Start difference. First operand 20824 states and 63498 transitions. Second operand 15 states. [2019-12-18 21:47:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:47:26,880 INFO L93 Difference]: Finished difference Result 40518 states and 122756 transitions. [2019-12-18 21:47:26,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 21:47:26,881 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 21:47:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:47:26,943 INFO L225 Difference]: With dead ends: 40518 [2019-12-18 21:47:26,944 INFO L226 Difference]: Without dead ends: 39751 [2019-12-18 21:47:26,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=464, Invalid=2398, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 21:47:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39751 states. [2019-12-18 21:47:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39751 to 22548. [2019-12-18 21:47:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22548 states. [2019-12-18 21:47:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22548 states to 22548 states and 68886 transitions. [2019-12-18 21:47:27,438 INFO L78 Accepts]: Start accepts. Automaton has 22548 states and 68886 transitions. Word has length 67 [2019-12-18 21:47:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:47:27,439 INFO L462 AbstractCegarLoop]: Abstraction has 22548 states and 68886 transitions. [2019-12-18 21:47:27,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:47:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 22548 states and 68886 transitions. [2019-12-18 21:47:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:47:27,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:47:27,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:47:27,466 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:47:27,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:47:27,466 INFO L82 PathProgramCache]: Analyzing trace with hash -340540590, now seen corresponding path program 9 times [2019-12-18 21:47:27,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:47:27,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681357041] [2019-12-18 21:47:27,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:47:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:47:27,887 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 21:47:27,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681357041] [2019-12-18 21:47:27,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:47:27,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:47:27,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311589489] [2019-12-18 21:47:27,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:47:27,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:47:27,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:47:27,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:47:27,889 INFO L87 Difference]: Start difference. First operand 22548 states and 68886 transitions. Second operand 15 states. [2019-12-18 21:47:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:47:32,129 INFO L93 Difference]: Finished difference Result 40291 states and 121670 transitions. [2019-12-18 21:47:32,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 21:47:32,129 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 21:47:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:47:32,183 INFO L225 Difference]: With dead ends: 40291 [2019-12-18 21:47:32,183 INFO L226 Difference]: Without dead ends: 38060 [2019-12-18 21:47:32,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=482, Invalid=2170, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 21:47:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38060 states. [2019-12-18 21:47:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38060 to 20658. [2019-12-18 21:47:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20658 states. [2019-12-18 21:47:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20658 states to 20658 states and 63065 transitions. [2019-12-18 21:47:32,597 INFO L78 Accepts]: Start accepts. Automaton has 20658 states and 63065 transitions. Word has length 67 [2019-12-18 21:47:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:47:32,597 INFO L462 AbstractCegarLoop]: Abstraction has 20658 states and 63065 transitions. [2019-12-18 21:47:32,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:47:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 20658 states and 63065 transitions. [2019-12-18 21:47:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:47:32,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:47:32,618 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 21:47:32,618 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:47:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:47:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1590486634, now seen corresponding path program 10 times [2019-12-18 21:47:32,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:47:32,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644911244] [2019-12-18 21:47:32,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:47:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:47:32,726 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 21:47:32,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644911244] [2019-12-18 21:47:32,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:47:32,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:47:32,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632614348] [2019-12-18 21:47:32,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:47:32,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:47:32,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:47:32,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:47:32,728 INFO L87 Difference]: Start difference. First operand 20658 states and 63065 transitions. Second operand 9 states. [2019-12-18 21:47:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:47:34,033 INFO L93 Difference]: Finished difference Result 36015 states and 109674 transitions. [2019-12-18 21:47:34,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:47:34,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 21:47:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:47:34,077 INFO L225 Difference]: With dead ends: 36015 [2019-12-18 21:47:34,077 INFO L226 Difference]: Without dead ends: 30353 [2019-12-18 21:47:34,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:47:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30353 states. [2019-12-18 21:47:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30353 to 20552. [2019-12-18 21:47:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20552 states. [2019-12-18 21:47:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20552 states to 20552 states and 62671 transitions. [2019-12-18 21:47:34,438 INFO L78 Accepts]: Start accepts. Automaton has 20552 states and 62671 transitions. Word has length 67 [2019-12-18 21:47:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:47:34,438 INFO L462 AbstractCegarLoop]: Abstraction has 20552 states and 62671 transitions. [2019-12-18 21:47:34,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:47:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20552 states and 62671 transitions. [2019-12-18 21:47:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:47:34,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:47:34,458 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 21:47:34,458 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:47:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:47:34,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2065181176, now seen corresponding path program 11 times [2019-12-18 21:47:34,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:47:34,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582443317] [2019-12-18 21:47:34,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:47:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:47:34,676 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 21:47:34,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582443317] [2019-12-18 21:47:34,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:47:34,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:47:34,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549573616] [2019-12-18 21:47:34,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:47:34,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:47:34,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:47:34,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:47:34,679 INFO L87 Difference]: Start difference. First operand 20552 states and 62671 transitions. Second operand 11 states. [2019-12-18 21:47:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:47:35,761 INFO L93 Difference]: Finished difference Result 38188 states and 116941 transitions. [2019-12-18 21:47:35,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 21:47:35,761 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:47:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:47:35,813 INFO L225 Difference]: With dead ends: 38188 [2019-12-18 21:47:35,814 INFO L226 Difference]: Without dead ends: 36273 [2019-12-18 21:47:35,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-18 21:47:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36273 states. [2019-12-18 21:47:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36273 to 22568. [2019-12-18 21:47:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22568 states. [2019-12-18 21:47:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22568 states to 22568 states and 69136 transitions. [2019-12-18 21:47:36,501 INFO L78 Accepts]: Start accepts. Automaton has 22568 states and 69136 transitions. Word has length 67 [2019-12-18 21:47:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:47:36,501 INFO L462 AbstractCegarLoop]: Abstraction has 22568 states and 69136 transitions. [2019-12-18 21:47:36,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:47:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 22568 states and 69136 transitions. [2019-12-18 21:47:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:47:36,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:47:36,524 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 21:47:36,524 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:47:36,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:47:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash 688286730, now seen corresponding path program 12 times [2019-12-18 21:47:36,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:47:36,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227166205] [2019-12-18 21:47:36,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:47:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:47:36,672 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 21:47:36,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227166205] [2019-12-18 21:47:36,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:47:36,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:47:36,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095623657] [2019-12-18 21:47:36,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:47:36,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:47:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:47:36,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:47:36,674 INFO L87 Difference]: Start difference. First operand 22568 states and 69136 transitions. Second operand 11 states. [2019-12-18 21:47:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:47:37,555 INFO L93 Difference]: Finished difference Result 36823 states and 112424 transitions. [2019-12-18 21:47:37,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 21:47:37,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:47:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:47:37,600 INFO L225 Difference]: With dead ends: 36823 [2019-12-18 21:47:37,601 INFO L226 Difference]: Without dead ends: 32324 [2019-12-18 21:47:37,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:47:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32324 states. [2019-12-18 21:47:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32324 to 19686. [2019-12-18 21:47:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19686 states. [2019-12-18 21:47:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19686 states to 19686 states and 60132 transitions. [2019-12-18 21:47:37,981 INFO L78 Accepts]: Start accepts. Automaton has 19686 states and 60132 transitions. Word has length 67 [2019-12-18 21:47:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:47:37,982 INFO L462 AbstractCegarLoop]: Abstraction has 19686 states and 60132 transitions. [2019-12-18 21:47:37,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:47:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19686 states and 60132 transitions. [2019-12-18 21:47:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:47:38,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:47:38,003 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 21:47:38,003 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:47:38,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:47:38,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 13 times [2019-12-18 21:47:38,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:47:38,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923204597] [2019-12-18 21:47:38,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:47:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:47:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:47:38,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:47:38,120 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:47:38,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1388~0.base_23| 4)) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$r_buff0_thd2~0_19 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_23|) |v_ULTIMATE.start_main_~#t1388~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= |v_ULTIMATE.start_main_~#t1388~0.offset_17| 0) (= 0 |v_#NULL.base_6|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_23|) 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1388~0.base_23|) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_23| 1)) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 v_~z$r_buff1_thd1~0_16) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_18|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_~#t1388~0.base=|v_ULTIMATE.start_main_~#t1388~0.base_23|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_22|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_17|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ULTIMATE.start_main_~#t1388~0.offset=|v_ULTIMATE.start_main_~#t1388~0.offset_17|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_13|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1389~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1390~0.base, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1388~0.base, 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_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1389~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t1388~0.offset, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-18 21:47:38,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1389~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1389~0.offset_8| 0) (not (= |v_ULTIMATE.start_main_~#t1389~0.base_9| 0)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9| 1) |v_#valid_33|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1389~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9|) |v_ULTIMATE.start_main_~#t1389~0.offset_8| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_9|, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1389~0.base, ULTIMATE.start_main_~#t1389~0.offset] because there is no mapped edge [2019-12-18 21:47:38,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork0_~arg.offset_Out-862311869 |P0Thread1of1ForFork0_#in~arg.offset_In-862311869|) (= ~z$w_buff1_used~0_Out-862311869 ~z$w_buff0_used~0_In-862311869) (= 0 (mod ~z$w_buff1_used~0_Out-862311869 256)) (= 1 ~z$w_buff0_used~0_Out-862311869) (= P0Thread1of1ForFork0_~arg.base_Out-862311869 |P0Thread1of1ForFork0_#in~arg.base_In-862311869|) (= ~z$w_buff1~0_Out-862311869 ~z$w_buff0~0_In-862311869) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-862311869| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-862311869) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-862311869|) (= 1 ~z$w_buff0~0_Out-862311869)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-862311869|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-862311869, ~z$w_buff0~0=~z$w_buff0~0_In-862311869, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-862311869|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-862311869|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-862311869, ~z$w_buff0~0=~z$w_buff0~0_Out-862311869, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-862311869, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-862311869, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-862311869|, ~z$w_buff1~0=~z$w_buff1~0_Out-862311869, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-862311869, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-862311869|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-862311869} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:47:38,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1390~0.base_11| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11|) |v_ULTIMATE.start_main_~#t1390~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1390~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1390~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t1390~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1390~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-18 21:47:38,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2061756848 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-2061756848| |P1Thread1of1ForFork1_#t~ite10_Out-2061756848|)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-2061756848 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out-2061756848| ~z~0_In-2061756848)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-2061756848| ~z$w_buff1~0_In-2061756848) (not .cse1) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2061756848, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2061756848, ~z$w_buff1~0=~z$w_buff1~0_In-2061756848, ~z~0=~z~0_In-2061756848} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2061756848|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2061756848, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2061756848, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-2061756848|, ~z$w_buff1~0=~z$w_buff1~0_In-2061756848, ~z~0=~z~0_In-2061756848} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 21:47:38,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1654312677 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1654312677 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1654312677| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1654312677| ~z$w_buff0_used~0_In-1654312677) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654312677, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1654312677} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654312677, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1654312677|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1654312677} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:47:38,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In840163484 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In840163484 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In840163484 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In840163484 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out840163484|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In840163484 |P1Thread1of1ForFork1_#t~ite12_Out840163484|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In840163484, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In840163484, ~z$w_buff1_used~0=~z$w_buff1_used~0_In840163484, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In840163484} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In840163484, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In840163484, ~z$w_buff1_used~0=~z$w_buff1_used~0_In840163484, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out840163484|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In840163484} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:47:38,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1930325089 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1930325089 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1930325089 |P1Thread1of1ForFork1_#t~ite13_Out1930325089|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1930325089|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1930325089, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1930325089} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1930325089, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1930325089|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1930325089} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 21:47:38,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In415894110 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In415894110| |P2Thread1of1ForFork2_#t~ite23_Out415894110|) (= |P2Thread1of1ForFork2_#t~ite24_Out415894110| ~z$w_buff1~0_In415894110)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In415894110 256) 0))) (or (= (mod ~z$w_buff0_used~0_In415894110 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In415894110 256)) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In415894110 256))))) .cse0 (= |P2Thread1of1ForFork2_#t~ite24_Out415894110| |P2Thread1of1ForFork2_#t~ite23_Out415894110|) (= |P2Thread1of1ForFork2_#t~ite23_Out415894110| ~z$w_buff1~0_In415894110)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In415894110|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In415894110, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In415894110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In415894110, ~z$w_buff1~0=~z$w_buff1~0_In415894110, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In415894110, ~weak$$choice2~0=~weak$$choice2~0_In415894110} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out415894110|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out415894110|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In415894110, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In415894110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In415894110, ~z$w_buff1~0=~z$w_buff1~0_In415894110, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In415894110, ~weak$$choice2~0=~weak$$choice2~0_In415894110} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 21:47:38,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1673842751 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1673842751 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In1673842751 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In1673842751 256)) (and (= 0 (mod ~z$w_buff1_used~0_In1673842751 256)) .cse0))) (= |P2Thread1of1ForFork2_#t~ite26_Out1673842751| |P2Thread1of1ForFork2_#t~ite27_Out1673842751|) .cse1 (= |P2Thread1of1ForFork2_#t~ite26_Out1673842751| ~z$w_buff0_used~0_In1673842751)) (and (= |P2Thread1of1ForFork2_#t~ite27_Out1673842751| ~z$w_buff0_used~0_In1673842751) (= |P2Thread1of1ForFork2_#t~ite26_In1673842751| |P2Thread1of1ForFork2_#t~ite26_Out1673842751|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1673842751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1673842751, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1673842751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1673842751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1673842751, ~weak$$choice2~0=~weak$$choice2~0_In1673842751} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1673842751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1673842751, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1673842751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1673842751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1673842751, ~weak$$choice2~0=~weak$$choice2~0_In1673842751, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1673842751|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 21:47:38,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In33340187 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In33340187 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In33340187 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In33340187 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out33340187|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out33340187| ~z$r_buff1_thd2~0_In33340187)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In33340187, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In33340187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In33340187, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In33340187} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In33340187, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In33340187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In33340187, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out33340187|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In33340187} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:47:38,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:47:38,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1323204103 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out1323204103| ~z$w_buff1_used~0_In1323204103) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1323204103 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1323204103 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In1323204103 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1323204103 256))))) (= |P2Thread1of1ForFork2_#t~ite30_Out1323204103| |P2Thread1of1ForFork2_#t~ite29_Out1323204103|)) (and (= |P2Thread1of1ForFork2_#t~ite30_Out1323204103| ~z$w_buff1_used~0_In1323204103) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In1323204103| |P2Thread1of1ForFork2_#t~ite29_Out1323204103|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1323204103, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1323204103, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1323204103, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1323204103, ~weak$$choice2~0=~weak$$choice2~0_In1323204103, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1323204103|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1323204103|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1323204103, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1323204103, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1323204103, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1323204103, ~weak$$choice2~0=~weak$$choice2~0_In1323204103, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1323204103|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 21:47:38,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:47:38,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:47:38,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-537307077 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-537307077 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-537307077| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-537307077| ~z$w_buff0_used~0_In-537307077)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-537307077, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-537307077} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-537307077|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-537307077, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-537307077} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:47:38,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2104617063 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-2104617063 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-2104617063 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2104617063 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2104617063|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-2104617063| ~z$w_buff1_used~0_In-2104617063)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2104617063, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2104617063, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2104617063, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2104617063} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2104617063|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2104617063, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2104617063, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2104617063, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2104617063} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:47:38,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In560655379 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In560655379 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out560655379)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In560655379 ~z$r_buff0_thd1~0_Out560655379)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In560655379, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In560655379} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In560655379, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out560655379|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out560655379} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:47:38,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-196838104 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-196838104 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-196838104 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-196838104 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-196838104| ~z$r_buff1_thd1~0_In-196838104) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-196838104| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-196838104, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-196838104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-196838104, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-196838104} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-196838104, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-196838104|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-196838104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-196838104, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-196838104} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:47:38,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:47:38,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out-2074367458| |P2Thread1of1ForFork2_#t~ite38_Out-2074367458|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2074367458 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-2074367458 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-2074367458| ~z~0_In-2074367458)) (and .cse2 (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-2074367458| ~z$w_buff1~0_In-2074367458) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2074367458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2074367458, ~z$w_buff1~0=~z$w_buff1~0_In-2074367458, ~z~0=~z~0_In-2074367458} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2074367458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2074367458, ~z$w_buff1~0=~z$w_buff1~0_In-2074367458, ~z~0=~z~0_In-2074367458, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-2074367458|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-2074367458|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 21:47:38,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1695487575 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1695487575 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-1695487575|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1695487575 |P2Thread1of1ForFork2_#t~ite40_Out-1695487575|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1695487575, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1695487575} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1695487575, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1695487575, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1695487575|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 21:47:38,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1876735593 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1876735593 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1876735593 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1876735593 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out1876735593| ~z$w_buff1_used~0_In1876735593) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite41_Out1876735593| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1876735593, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1876735593, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1876735593, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1876735593} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1876735593|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1876735593, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1876735593, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1876735593, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1876735593} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 21:47:38,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1935918134 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1935918134 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-1935918134| ~z$r_buff0_thd3~0_In-1935918134) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1935918134|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1935918134, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1935918134} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1935918134|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1935918134, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1935918134} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 21:47:38,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In753682537 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In753682537 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In753682537 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In753682537 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out753682537| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite43_Out753682537| ~z$r_buff1_thd3~0_In753682537)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In753682537, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In753682537, ~z$w_buff1_used~0=~z$w_buff1_used~0_In753682537, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In753682537} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In753682537, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In753682537, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out753682537|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In753682537, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In753682537} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 21:47:38,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 21:47:38,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~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 21:47:38,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1997315586 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1997315586 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out1997315586| |ULTIMATE.start_main_#t~ite47_Out1997315586|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In1997315586 |ULTIMATE.start_main_#t~ite47_Out1997315586|)) (and (not .cse1) (not .cse0) .cse2 (= ~z$w_buff1~0_In1997315586 |ULTIMATE.start_main_#t~ite47_Out1997315586|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1997315586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1997315586, ~z$w_buff1~0=~z$w_buff1~0_In1997315586, ~z~0=~z~0_In1997315586} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1997315586, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1997315586|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1997315586, ~z$w_buff1~0=~z$w_buff1~0_In1997315586, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1997315586|, ~z~0=~z~0_In1997315586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:47:38,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In510426893 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In510426893 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In510426893 |ULTIMATE.start_main_#t~ite49_Out510426893|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out510426893|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In510426893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In510426893} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In510426893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In510426893, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out510426893|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:47:38,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1716436397 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1716436397 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1716436397 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1716436397 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1716436397 |ULTIMATE.start_main_#t~ite50_Out1716436397|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1716436397|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1716436397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1716436397, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1716436397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1716436397} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1716436397|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1716436397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1716436397, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1716436397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1716436397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:47:38,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-914435735 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-914435735 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-914435735| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-914435735| ~z$r_buff0_thd0~0_In-914435735)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-914435735, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-914435735} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-914435735, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-914435735|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-914435735} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:47:38,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1822441272 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1822441272 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1822441272 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1822441272 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In1822441272 |ULTIMATE.start_main_#t~ite52_Out1822441272|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1822441272|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1822441272, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1822441272, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1822441272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1822441272} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1822441272|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1822441272, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1822441272, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1822441272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1822441272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:47:38,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__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, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 21:47:38,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:47:38 BasicIcfg [2019-12-18 21:47:38,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:47:38,234 INFO L168 Benchmark]: Toolchain (without parser) took 148441.04 ms. Allocated memory was 146.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 102.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 21:47:38,234 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 21:47:38,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.99 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.2 MB in the beginning and 156.8 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:47:38,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:47:38,235 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:47:38,236 INFO L168 Benchmark]: RCFGBuilder took 862.55 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 101.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:47:38,236 INFO L168 Benchmark]: TraceAbstraction took 146630.43 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 21:47:38,238 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.55 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.99 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.2 MB in the beginning and 156.8 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.29 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 862.55 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 101.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146630.43 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 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.3s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6848 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L744] 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_p1_EAX=0, __unbuffered_p2_EAX=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] [L822] FCALL, FORK 0 pthread_create(&t1389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L824] FCALL, FORK 0 pthread_create(&t1390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, 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] 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_p1_EAX=0, __unbuffered_p2_EAX=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=2, 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 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, 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] [L785] 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, 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_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=2, 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] [L766] 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 [L786] 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)) [L787] 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)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 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)) [L789] 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)) [L791] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=2, 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] [L791] 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)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, 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_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 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 [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1, 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] [L830] 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) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 146.3s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 72.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10173 SDtfs, 16095 SDslu, 44628 SDs, 0 SdLazy, 40558 SolverSat, 804 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 789 GetRequests, 52 SyntacticMatches, 41 SemanticMatches, 696 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8738 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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: 44.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 394194 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2006 NumberOfCodeBlocks, 2006 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1903 ConstructedInterpolants, 0 QuantifiedInterpolants, 567373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...