/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 13:03:01,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 13:03:01,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 13:03:01,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 13:03:01,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 13:03:01,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 13:03:01,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 13:03:01,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 13:03:01,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 13:03:01,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 13:03:01,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 13:03:01,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 13:03:01,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 13:03:01,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 13:03:01,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 13:03:01,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 13:03:01,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 13:03:01,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 13:03:01,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 13:03:01,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 13:03:01,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 13:03:01,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 13:03:01,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 13:03:01,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 13:03:01,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 13:03:01,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 13:03:01,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 13:03:01,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 13:03:01,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 13:03:01,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 13:03:01,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 13:03:01,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 13:03:01,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 13:03:01,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 13:03:01,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 13:03:01,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 13:03:01,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 13:03:01,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 13:03:01,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 13:03:01,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 13:03:01,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 13:03:01,315 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-NoLbe.epf [2019-12-27 13:03:01,329 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 13:03:01,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 13:03:01,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 13:03:01,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 13:03:01,330 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 13:03:01,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 13:03:01,331 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 13:03:01,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 13:03:01,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 13:03:01,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 13:03:01,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 13:03:01,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 13:03:01,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 13:03:01,332 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 13:03:01,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 13:03:01,333 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 13:03:01,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 13:03:01,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 13:03:01,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 13:03:01,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 13:03:01,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 13:03:01,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 13:03:01,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 13:03:01,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 13:03:01,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 13:03:01,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 13:03:01,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 13:03:01,335 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 13:03:01,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 13:03:01,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 13:03:01,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 13:03:01,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 13:03:01,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 13:03:01,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 13:03:01,657 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 13:03:01,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i [2019-12-27 13:03:01,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e546c98/5ce0394a3bf040bab153501e3a429839/FLAGff38f3185 [2019-12-27 13:03:02,260 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 13:03:02,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i [2019-12-27 13:03:02,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e546c98/5ce0394a3bf040bab153501e3a429839/FLAGff38f3185 [2019-12-27 13:03:02,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e546c98/5ce0394a3bf040bab153501e3a429839 [2019-12-27 13:03:02,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 13:03:02,547 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 13:03:02,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 13:03:02,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 13:03:02,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 13:03:02,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:03:02" (1/1) ... [2019-12-27 13:03:02,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23abe169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:02, skipping insertion in model container [2019-12-27 13:03:02,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:03:02" (1/1) ... [2019-12-27 13:03:02,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 13:03:02,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 13:03:03,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:03:03,268 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 13:03:03,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:03:03,410 INFO L208 MainTranslator]: Completed translation [2019-12-27 13:03:03,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03 WrapperNode [2019-12-27 13:03:03,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 13:03:03,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 13:03:03,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 13:03:03,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 13:03:03,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... [2019-12-27 13:03:03,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... [2019-12-27 13:03:03,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 13:03:03,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 13:03:03,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 13:03:03,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 13:03:03,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... [2019-12-27 13:03:03,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... [2019-12-27 13:03:03,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... [2019-12-27 13:03:03,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... [2019-12-27 13:03:03,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... [2019-12-27 13:03:03,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... [2019-12-27 13:03:03,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... [2019-12-27 13:03:03,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 13:03:03,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 13:03:03,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 13:03:03,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 13:03:03,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 13:03:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 13:03:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 13:03:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 13:03:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 13:03:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 13:03:03,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 13:03:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 13:03:03,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 13:03:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 13:03:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 13:03:03,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 13:03:03,633 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 13:03:04,550 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 13:03:04,551 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 13:03:04,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:03:04 BoogieIcfgContainer [2019-12-27 13:03:04,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 13:03:04,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 13:03:04,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 13:03:04,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 13:03:04,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:03:02" (1/3) ... [2019-12-27 13:03:04,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445d785f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:03:04, skipping insertion in model container [2019-12-27 13:03:04,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:03:03" (2/3) ... [2019-12-27 13:03:04,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445d785f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:03:04, skipping insertion in model container [2019-12-27 13:03:04,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:03:04" (3/3) ... [2019-12-27 13:03:04,561 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.oepc.i [2019-12-27 13:03:04,569 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 13:03:04,570 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 13:03:04,577 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 13:03:04,578 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 13:03:04,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,681 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,681 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,713 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,717 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,718 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:03:04,738 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 13:03:04,758 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 13:03:04,758 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 13:03:04,758 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 13:03:04,759 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 13:03:04,759 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 13:03:04,759 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 13:03:04,759 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 13:03:04,759 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 13:03:04,779 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 191 places, 246 transitions [2019-12-27 13:03:17,643 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100969 states. [2019-12-27 13:03:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 100969 states. [2019-12-27 13:03:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 13:03:17,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:03:17,654 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] [2019-12-27 13:03:17,655 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:03:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:03:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1761614935, now seen corresponding path program 1 times [2019-12-27 13:03:17,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:03:17,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823993026] [2019-12-27 13:03:17,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:03:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:03:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:03:17,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823993026] [2019-12-27 13:03:17,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:03:17,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:03:17,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830109979] [2019-12-27 13:03:17,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:03:17,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:03:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:03:18,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:03:18,017 INFO L87 Difference]: Start difference. First operand 100969 states. Second operand 4 states. [2019-12-27 13:03:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:03:19,656 INFO L93 Difference]: Finished difference Result 101969 states and 411474 transitions. [2019-12-27 13:03:19,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:03:19,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-27 13:03:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:03:22,592 INFO L225 Difference]: With dead ends: 101969 [2019-12-27 13:03:22,593 INFO L226 Difference]: Without dead ends: 74593 [2019-12-27 13:03:22,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:03:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74593 states. [2019-12-27 13:03:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74593 to 74593. [2019-12-27 13:03:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74593 states. [2019-12-27 13:03:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74593 states to 74593 states and 304546 transitions. [2019-12-27 13:03:26,864 INFO L78 Accepts]: Start accepts. Automaton has 74593 states and 304546 transitions. Word has length 36 [2019-12-27 13:03:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:03:26,866 INFO L462 AbstractCegarLoop]: Abstraction has 74593 states and 304546 transitions. [2019-12-27 13:03:26,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:03:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 74593 states and 304546 transitions. [2019-12-27 13:03:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 13:03:26,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:03:26,879 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] [2019-12-27 13:03:26,879 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:03:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:03:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -776334369, now seen corresponding path program 1 times [2019-12-27 13:03:26,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:03:26,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050718205] [2019-12-27 13:03:26,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:03:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:03:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:03:27,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050718205] [2019-12-27 13:03:27,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:03:27,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:03:27,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013840259] [2019-12-27 13:03:27,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:03:27,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:03:27,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:03:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:03:27,026 INFO L87 Difference]: Start difference. First operand 74593 states and 304546 transitions. Second operand 5 states. [2019-12-27 13:03:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:03:31,823 INFO L93 Difference]: Finished difference Result 121639 states and 464551 transitions. [2019-12-27 13:03:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:03:31,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 13:03:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:03:32,507 INFO L225 Difference]: With dead ends: 121639 [2019-12-27 13:03:32,508 INFO L226 Difference]: Without dead ends: 121103 [2019-12-27 13:03:32,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:03:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121103 states. [2019-12-27 13:03:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121103 to 119213. [2019-12-27 13:03:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119213 states. [2019-12-27 13:03:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119213 states to 119213 states and 456891 transitions. [2019-12-27 13:03:41,409 INFO L78 Accepts]: Start accepts. Automaton has 119213 states and 456891 transitions. Word has length 48 [2019-12-27 13:03:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:03:41,410 INFO L462 AbstractCegarLoop]: Abstraction has 119213 states and 456891 transitions. [2019-12-27 13:03:41,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:03:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 119213 states and 456891 transitions. [2019-12-27 13:03:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 13:03:41,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:03:41,417 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] [2019-12-27 13:03:41,417 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:03:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:03:41,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1542620855, now seen corresponding path program 1 times [2019-12-27 13:03:41,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:03:41,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881171578] [2019-12-27 13:03:41,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:03:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:03:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:03:41,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881171578] [2019-12-27 13:03:41,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:03:41,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:03:41,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228178537] [2019-12-27 13:03:41,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:03:41,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:03:41,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:03:41,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:03:41,551 INFO L87 Difference]: Start difference. First operand 119213 states and 456891 transitions. Second operand 5 states. [2019-12-27 13:03:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:03:42,671 INFO L93 Difference]: Finished difference Result 149065 states and 560747 transitions. [2019-12-27 13:03:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:03:42,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-27 13:03:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:03:43,070 INFO L225 Difference]: With dead ends: 149065 [2019-12-27 13:03:43,070 INFO L226 Difference]: Without dead ends: 148561 [2019-12-27 13:03:43,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:03:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148561 states. [2019-12-27 13:03:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148561 to 131878. [2019-12-27 13:03:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131878 states. [2019-12-27 13:03:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131878 states to 131878 states and 501408 transitions. [2019-12-27 13:03:52,853 INFO L78 Accepts]: Start accepts. Automaton has 131878 states and 501408 transitions. Word has length 49 [2019-12-27 13:03:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:03:52,854 INFO L462 AbstractCegarLoop]: Abstraction has 131878 states and 501408 transitions. [2019-12-27 13:03:52,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:03:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 131878 states and 501408 transitions. [2019-12-27 13:03:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 13:03:52,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:03:52,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:03:52,866 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:03:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:03:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1726220477, now seen corresponding path program 1 times [2019-12-27 13:03:52,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:03:52,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895082142] [2019-12-27 13:03:52,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:03:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:03:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:03:52,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895082142] [2019-12-27 13:03:52,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:03:52,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:03:52,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968181104] [2019-12-27 13:03:52,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:03:52,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:03:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:03:52,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:03:52,926 INFO L87 Difference]: Start difference. First operand 131878 states and 501408 transitions. Second operand 3 states. [2019-12-27 13:03:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:03:59,282 INFO L93 Difference]: Finished difference Result 226103 states and 838073 transitions. [2019-12-27 13:03:59,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:03:59,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 13:03:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:03:59,971 INFO L225 Difference]: With dead ends: 226103 [2019-12-27 13:03:59,971 INFO L226 Difference]: Without dead ends: 226103 [2019-12-27 13:03:59,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:04:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226103 states. [2019-12-27 13:04:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226103 to 201720. [2019-12-27 13:04:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201720 states. [2019-12-27 13:04:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201720 states to 201720 states and 750697 transitions. [2019-12-27 13:04:07,176 INFO L78 Accepts]: Start accepts. Automaton has 201720 states and 750697 transitions. Word has length 51 [2019-12-27 13:04:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:04:07,176 INFO L462 AbstractCegarLoop]: Abstraction has 201720 states and 750697 transitions. [2019-12-27 13:04:07,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:04:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 201720 states and 750697 transitions. [2019-12-27 13:04:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 13:04:07,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:04:07,203 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] [2019-12-27 13:04:07,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:04:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:04:07,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2125163740, now seen corresponding path program 1 times [2019-12-27 13:04:07,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:04:07,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789589837] [2019-12-27 13:04:07,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:04:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:04:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:04:07,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789589837] [2019-12-27 13:04:07,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:04:07,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:04:07,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680655487] [2019-12-27 13:04:07,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:04:07,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:04:07,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:04:07,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:04:07,358 INFO L87 Difference]: Start difference. First operand 201720 states and 750697 transitions. Second operand 6 states. [2019-12-27 13:04:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:04:16,354 INFO L93 Difference]: Finished difference Result 257719 states and 956292 transitions. [2019-12-27 13:04:16,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:04:16,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 13:04:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:04:17,027 INFO L225 Difference]: With dead ends: 257719 [2019-12-27 13:04:17,028 INFO L226 Difference]: Without dead ends: 257719 [2019-12-27 13:04:17,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:04:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257719 states. [2019-12-27 13:04:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257719 to 241036. [2019-12-27 13:04:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241036 states. [2019-12-27 13:04:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241036 states to 241036 states and 894179 transitions. [2019-12-27 13:04:25,334 INFO L78 Accepts]: Start accepts. Automaton has 241036 states and 894179 transitions. Word has length 55 [2019-12-27 13:04:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:04:25,335 INFO L462 AbstractCegarLoop]: Abstraction has 241036 states and 894179 transitions. [2019-12-27 13:04:25,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:04:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 241036 states and 894179 transitions. [2019-12-27 13:04:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 13:04:25,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:04:25,361 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] [2019-12-27 13:04:25,361 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:04:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:04:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash 372852197, now seen corresponding path program 1 times [2019-12-27 13:04:25,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:04:25,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442790311] [2019-12-27 13:04:25,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:04:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:04:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:04:25,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442790311] [2019-12-27 13:04:25,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:04:25,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:04:25,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007887181] [2019-12-27 13:04:25,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:04:25,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:04:25,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:04:25,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:04:25,487 INFO L87 Difference]: Start difference. First operand 241036 states and 894179 transitions. Second operand 7 states. [2019-12-27 13:04:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:04:34,493 INFO L93 Difference]: Finished difference Result 334522 states and 1202846 transitions. [2019-12-27 13:04:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:04:34,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 13:04:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:04:36,106 INFO L225 Difference]: With dead ends: 334522 [2019-12-27 13:04:36,106 INFO L226 Difference]: Without dead ends: 334522 [2019-12-27 13:04:36,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:04:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334522 states. [2019-12-27 13:04:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334522 to 278543. [2019-12-27 13:04:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278543 states. [2019-12-27 13:04:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278543 states to 278543 states and 1017057 transitions. [2019-12-27 13:04:49,806 INFO L78 Accepts]: Start accepts. Automaton has 278543 states and 1017057 transitions. Word has length 55 [2019-12-27 13:04:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:04:49,806 INFO L462 AbstractCegarLoop]: Abstraction has 278543 states and 1017057 transitions. [2019-12-27 13:04:49,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:04:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 278543 states and 1017057 transitions. [2019-12-27 13:04:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 13:04:49,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:04:49,828 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] [2019-12-27 13:04:49,828 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:04:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:04:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1260355878, now seen corresponding path program 1 times [2019-12-27 13:04:49,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:04:49,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489791888] [2019-12-27 13:04:49,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:04:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:04:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:04:49,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489791888] [2019-12-27 13:04:49,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:04:49,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:04:49,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445320114] [2019-12-27 13:04:49,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:04:49,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:04:49,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:04:49,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:04:49,899 INFO L87 Difference]: Start difference. First operand 278543 states and 1017057 transitions. Second operand 4 states. [2019-12-27 13:04:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:04:55,833 INFO L93 Difference]: Finished difference Result 34538 states and 108800 transitions. [2019-12-27 13:04:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:04:55,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 13:04:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:04:55,876 INFO L225 Difference]: With dead ends: 34538 [2019-12-27 13:04:55,877 INFO L226 Difference]: Without dead ends: 26989 [2019-12-27 13:04:55,877 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-27 13:04:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26989 states. [2019-12-27 13:04:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26989 to 26730. [2019-12-27 13:04:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26730 states. [2019-12-27 13:04:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26730 states to 26730 states and 81037 transitions. [2019-12-27 13:04:56,232 INFO L78 Accepts]: Start accepts. Automaton has 26730 states and 81037 transitions. Word has length 55 [2019-12-27 13:04:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:04:56,232 INFO L462 AbstractCegarLoop]: Abstraction has 26730 states and 81037 transitions. [2019-12-27 13:04:56,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:04:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 26730 states and 81037 transitions. [2019-12-27 13:04:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 13:04:56,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:04:56,236 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] [2019-12-27 13:04:56,236 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:04:56,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:04:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1217896248, now seen corresponding path program 1 times [2019-12-27 13:04:56,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:04:56,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303414327] [2019-12-27 13:04:56,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:04:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:04:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:04:56,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303414327] [2019-12-27 13:04:56,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:04:56,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:04:56,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248260878] [2019-12-27 13:04:56,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:04:56,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:04:56,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:04:56,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:04:56,364 INFO L87 Difference]: Start difference. First operand 26730 states and 81037 transitions. Second operand 6 states. [2019-12-27 13:04:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:04:57,161 INFO L93 Difference]: Finished difference Result 31474 states and 93784 transitions. [2019-12-27 13:04:57,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 13:04:57,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 13:04:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:04:57,229 INFO L225 Difference]: With dead ends: 31474 [2019-12-27 13:04:57,229 INFO L226 Difference]: Without dead ends: 31411 [2019-12-27 13:04:57,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 13:04:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31411 states. [2019-12-27 13:04:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31411 to 26773. [2019-12-27 13:04:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26773 states. [2019-12-27 13:04:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26773 states to 26773 states and 81115 transitions. [2019-12-27 13:04:57,636 INFO L78 Accepts]: Start accepts. Automaton has 26773 states and 81115 transitions. Word has length 55 [2019-12-27 13:04:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:04:57,636 INFO L462 AbstractCegarLoop]: Abstraction has 26773 states and 81115 transitions. [2019-12-27 13:04:57,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:04:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 26773 states and 81115 transitions. [2019-12-27 13:04:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 13:04:57,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:04:57,642 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] [2019-12-27 13:04:57,642 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:04:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:04:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1786247972, now seen corresponding path program 1 times [2019-12-27 13:04:57,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:04:57,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850684794] [2019-12-27 13:04:57,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:04:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:04:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:04:57,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850684794] [2019-12-27 13:04:57,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:04:57,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:04:57,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249393384] [2019-12-27 13:04:57,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:04:57,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:04:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:04:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:04:57,699 INFO L87 Difference]: Start difference. First operand 26773 states and 81115 transitions. Second operand 4 states. [2019-12-27 13:04:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:04:58,074 INFO L93 Difference]: Finished difference Result 29478 states and 89161 transitions. [2019-12-27 13:04:58,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:04:58,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-27 13:04:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:04:58,118 INFO L225 Difference]: With dead ends: 29478 [2019-12-27 13:04:58,119 INFO L226 Difference]: Without dead ends: 29478 [2019-12-27 13:04:58,119 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-27 13:04:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29478 states. [2019-12-27 13:04:58,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29478 to 27743. [2019-12-27 13:04:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27743 states. [2019-12-27 13:04:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27743 states to 27743 states and 83974 transitions. [2019-12-27 13:04:58,518 INFO L78 Accepts]: Start accepts. Automaton has 27743 states and 83974 transitions. Word has length 63 [2019-12-27 13:04:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:04:58,518 INFO L462 AbstractCegarLoop]: Abstraction has 27743 states and 83974 transitions. [2019-12-27 13:04:58,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:04:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 27743 states and 83974 transitions. [2019-12-27 13:04:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 13:04:58,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:04:58,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] [2019-12-27 13:04:58,524 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:04:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:04:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash -765908989, now seen corresponding path program 1 times [2019-12-27 13:04:58,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:04:58,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138382721] [2019-12-27 13:04:58,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:04:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:04:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:04:58,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138382721] [2019-12-27 13:04:58,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:04:58,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:04:58,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9141197] [2019-12-27 13:04:58,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:04:58,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:04:58,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:04:58,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:04:58,609 INFO L87 Difference]: Start difference. First operand 27743 states and 83974 transitions. Second operand 6 states. [2019-12-27 13:04:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:04:59,405 INFO L93 Difference]: Finished difference Result 35252 states and 104342 transitions. [2019-12-27 13:04:59,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 13:04:59,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-27 13:04:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:04:59,464 INFO L225 Difference]: With dead ends: 35252 [2019-12-27 13:04:59,464 INFO L226 Difference]: Without dead ends: 35191 [2019-12-27 13:04:59,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:04:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35191 states. [2019-12-27 13:04:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35191 to 34420. [2019-12-27 13:04:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34420 states. [2019-12-27 13:05:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34420 states to 34420 states and 102076 transitions. [2019-12-27 13:05:00,300 INFO L78 Accepts]: Start accepts. Automaton has 34420 states and 102076 transitions. Word has length 63 [2019-12-27 13:05:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:00,300 INFO L462 AbstractCegarLoop]: Abstraction has 34420 states and 102076 transitions. [2019-12-27 13:05:00,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:05:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 34420 states and 102076 transitions. [2019-12-27 13:05:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 13:05:00,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:00,309 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, 1, 1] [2019-12-27 13:05:00,310 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:00,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1293652052, now seen corresponding path program 1 times [2019-12-27 13:05:00,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:00,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128769540] [2019-12-27 13:05:00,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:00,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128769540] [2019-12-27 13:05:00,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:00,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:05:00,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348762540] [2019-12-27 13:05:00,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:05:00,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:00,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:05:00,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:05:00,357 INFO L87 Difference]: Start difference. First operand 34420 states and 102076 transitions. Second operand 3 states. [2019-12-27 13:05:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:00,536 INFO L93 Difference]: Finished difference Result 42956 states and 126097 transitions. [2019-12-27 13:05:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:05:00,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 13:05:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:00,597 INFO L225 Difference]: With dead ends: 42956 [2019-12-27 13:05:00,598 INFO L226 Difference]: Without dead ends: 42956 [2019-12-27 13:05:00,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:05:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42956 states. [2019-12-27 13:05:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42956 to 35387. [2019-12-27 13:05:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35387 states. [2019-12-27 13:05:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35387 states to 35387 states and 102964 transitions. [2019-12-27 13:05:01,090 INFO L78 Accepts]: Start accepts. Automaton has 35387 states and 102964 transitions. Word has length 69 [2019-12-27 13:05:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:01,090 INFO L462 AbstractCegarLoop]: Abstraction has 35387 states and 102964 transitions. [2019-12-27 13:05:01,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:05:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 35387 states and 102964 transitions. [2019-12-27 13:05:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 13:05:01,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:01,104 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:01,104 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash -582300025, now seen corresponding path program 1 times [2019-12-27 13:05:01,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:01,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090066628] [2019-12-27 13:05:01,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:01,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090066628] [2019-12-27 13:05:01,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:01,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:05:01,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758736593] [2019-12-27 13:05:01,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:05:01,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:01,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:05:01,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:05:01,168 INFO L87 Difference]: Start difference. First operand 35387 states and 102964 transitions. Second operand 5 states. [2019-12-27 13:05:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:01,646 INFO L93 Difference]: Finished difference Result 40929 states and 118812 transitions. [2019-12-27 13:05:01,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:05:01,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-27 13:05:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:01,703 INFO L225 Difference]: With dead ends: 40929 [2019-12-27 13:05:01,703 INFO L226 Difference]: Without dead ends: 40929 [2019-12-27 13:05:01,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:05:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40929 states. [2019-12-27 13:05:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40929 to 39056. [2019-12-27 13:05:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39056 states. [2019-12-27 13:05:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39056 states to 39056 states and 113480 transitions. [2019-12-27 13:05:02,512 INFO L78 Accepts]: Start accepts. Automaton has 39056 states and 113480 transitions. Word has length 75 [2019-12-27 13:05:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:02,512 INFO L462 AbstractCegarLoop]: Abstraction has 39056 states and 113480 transitions. [2019-12-27 13:05:02,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:05:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 39056 states and 113480 transitions. [2019-12-27 13:05:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 13:05:02,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:02,529 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:02,529 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:02,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1160510310, now seen corresponding path program 1 times [2019-12-27 13:05:02,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:02,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674043098] [2019-12-27 13:05:02,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:02,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-27 13:05:02,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674043098] [2019-12-27 13:05:02,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:02,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:05:02,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567280414] [2019-12-27 13:05:02,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:05:02,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:02,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:05:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:02,625 INFO L87 Difference]: Start difference. First operand 39056 states and 113480 transitions. Second operand 7 states. [2019-12-27 13:05:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:03,690 INFO L93 Difference]: Finished difference Result 43100 states and 124718 transitions. [2019-12-27 13:05:03,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:05:03,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-27 13:05:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:03,749 INFO L225 Difference]: With dead ends: 43100 [2019-12-27 13:05:03,749 INFO L226 Difference]: Without dead ends: 43023 [2019-12-27 13:05:03,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 13:05:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43023 states. [2019-12-27 13:05:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43023 to 36439. [2019-12-27 13:05:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36439 states. [2019-12-27 13:05:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36439 states to 36439 states and 106972 transitions. [2019-12-27 13:05:04,608 INFO L78 Accepts]: Start accepts. Automaton has 36439 states and 106972 transitions. Word has length 75 [2019-12-27 13:05:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:04,609 INFO L462 AbstractCegarLoop]: Abstraction has 36439 states and 106972 transitions. [2019-12-27 13:05:04,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:05:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 36439 states and 106972 transitions. [2019-12-27 13:05:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 13:05:04,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:04,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:04,622 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash 406738322, now seen corresponding path program 1 times [2019-12-27 13:05:04,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:04,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008695251] [2019-12-27 13:05:04,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:04,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008695251] [2019-12-27 13:05:04,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:04,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:05:04,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229246588] [2019-12-27 13:05:04,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:05:04,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:04,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:05:04,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:04,709 INFO L87 Difference]: Start difference. First operand 36439 states and 106972 transitions. Second operand 7 states. [2019-12-27 13:05:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:05,822 INFO L93 Difference]: Finished difference Result 48613 states and 140149 transitions. [2019-12-27 13:05:05,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 13:05:05,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-27 13:05:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:05,888 INFO L225 Difference]: With dead ends: 48613 [2019-12-27 13:05:05,888 INFO L226 Difference]: Without dead ends: 48565 [2019-12-27 13:05:05,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 13:05:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48565 states. [2019-12-27 13:05:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48565 to 40512. [2019-12-27 13:05:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40512 states. [2019-12-27 13:05:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40512 states to 40512 states and 117398 transitions. [2019-12-27 13:05:06,437 INFO L78 Accepts]: Start accepts. Automaton has 40512 states and 117398 transitions. Word has length 77 [2019-12-27 13:05:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:06,437 INFO L462 AbstractCegarLoop]: Abstraction has 40512 states and 117398 transitions. [2019-12-27 13:05:06,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:05:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 40512 states and 117398 transitions. [2019-12-27 13:05:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 13:05:06,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:06,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:06,456 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:06,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:06,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1183066378, now seen corresponding path program 1 times [2019-12-27 13:05:06,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:06,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747065560] [2019-12-27 13:05:06,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:06,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747065560] [2019-12-27 13:05:06,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:06,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:05:06,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178123612] [2019-12-27 13:05:06,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:05:06,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:06,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:05:06,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:05:06,501 INFO L87 Difference]: Start difference. First operand 40512 states and 117398 transitions. Second operand 3 states. [2019-12-27 13:05:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:06,891 INFO L93 Difference]: Finished difference Result 49571 states and 141798 transitions. [2019-12-27 13:05:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:05:06,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-27 13:05:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:07,205 INFO L225 Difference]: With dead ends: 49571 [2019-12-27 13:05:07,205 INFO L226 Difference]: Without dead ends: 49571 [2019-12-27 13:05:07,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:05:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49571 states. [2019-12-27 13:05:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49571 to 45675. [2019-12-27 13:05:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45675 states. [2019-12-27 13:05:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45675 states to 45675 states and 131329 transitions. [2019-12-27 13:05:07,745 INFO L78 Accepts]: Start accepts. Automaton has 45675 states and 131329 transitions. Word has length 82 [2019-12-27 13:05:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:07,746 INFO L462 AbstractCegarLoop]: Abstraction has 45675 states and 131329 transitions. [2019-12-27 13:05:07,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:05:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 45675 states and 131329 transitions. [2019-12-27 13:05:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 13:05:07,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:07,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:07,772 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1797217747, now seen corresponding path program 1 times [2019-12-27 13:05:07,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:07,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363456401] [2019-12-27 13:05:07,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:07,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363456401] [2019-12-27 13:05:07,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:07,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:05:07,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5271344] [2019-12-27 13:05:07,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:05:07,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:07,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:05:07,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:05:07,838 INFO L87 Difference]: Start difference. First operand 45675 states and 131329 transitions. Second operand 4 states. [2019-12-27 13:05:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:08,241 INFO L93 Difference]: Finished difference Result 50506 states and 144515 transitions. [2019-12-27 13:05:08,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:05:08,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-27 13:05:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:08,315 INFO L225 Difference]: With dead ends: 50506 [2019-12-27 13:05:08,315 INFO L226 Difference]: Without dead ends: 50506 [2019-12-27 13:05:08,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:05:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50506 states. [2019-12-27 13:05:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50506 to 49663. [2019-12-27 13:05:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49663 states. [2019-12-27 13:05:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49663 states to 49663 states and 142083 transitions. [2019-12-27 13:05:09,201 INFO L78 Accepts]: Start accepts. Automaton has 49663 states and 142083 transitions. Word has length 83 [2019-12-27 13:05:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:09,201 INFO L462 AbstractCegarLoop]: Abstraction has 49663 states and 142083 transitions. [2019-12-27 13:05:09,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:05:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 49663 states and 142083 transitions. [2019-12-27 13:05:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 13:05:09,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:09,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:09,232 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:09,232 INFO L82 PathProgramCache]: Analyzing trace with hash -279991596, now seen corresponding path program 1 times [2019-12-27 13:05:09,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:09,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503035165] [2019-12-27 13:05:09,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:09,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503035165] [2019-12-27 13:05:09,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:09,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:05:09,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065510580] [2019-12-27 13:05:09,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:05:09,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:05:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:05:09,273 INFO L87 Difference]: Start difference. First operand 49663 states and 142083 transitions. Second operand 3 states. [2019-12-27 13:05:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:09,693 INFO L93 Difference]: Finished difference Result 60693 states and 170203 transitions. [2019-12-27 13:05:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:05:09,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-27 13:05:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:09,779 INFO L225 Difference]: With dead ends: 60693 [2019-12-27 13:05:09,779 INFO L226 Difference]: Without dead ends: 60693 [2019-12-27 13:05:09,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:05:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60693 states. [2019-12-27 13:05:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60693 to 56625. [2019-12-27 13:05:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56625 states. [2019-12-27 13:05:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56625 states to 56625 states and 159736 transitions. [2019-12-27 13:05:10,546 INFO L78 Accepts]: Start accepts. Automaton has 56625 states and 159736 transitions. Word has length 83 [2019-12-27 13:05:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:10,546 INFO L462 AbstractCegarLoop]: Abstraction has 56625 states and 159736 transitions. [2019-12-27 13:05:10,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:05:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 56625 states and 159736 transitions. [2019-12-27 13:05:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 13:05:11,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:11,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:11,013 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash -276703570, now seen corresponding path program 1 times [2019-12-27 13:05:11,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:11,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801884823] [2019-12-27 13:05:11,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:11,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801884823] [2019-12-27 13:05:11,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:11,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:05:11,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296838457] [2019-12-27 13:05:11,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:05:11,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:11,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:05:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:05:11,078 INFO L87 Difference]: Start difference. First operand 56625 states and 159736 transitions. Second operand 4 states. [2019-12-27 13:05:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:11,441 INFO L93 Difference]: Finished difference Result 59784 states and 166836 transitions. [2019-12-27 13:05:11,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:05:11,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-27 13:05:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:11,564 INFO L225 Difference]: With dead ends: 59784 [2019-12-27 13:05:11,564 INFO L226 Difference]: Without dead ends: 59784 [2019-12-27 13:05:11,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:05:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59784 states. [2019-12-27 13:05:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59784 to 56662. [2019-12-27 13:05:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56662 states. [2019-12-27 13:05:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56662 states to 56662 states and 158140 transitions. [2019-12-27 13:05:12,342 INFO L78 Accepts]: Start accepts. Automaton has 56662 states and 158140 transitions. Word has length 84 [2019-12-27 13:05:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:12,342 INFO L462 AbstractCegarLoop]: Abstraction has 56662 states and 158140 transitions. [2019-12-27 13:05:12,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:05:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 56662 states and 158140 transitions. [2019-12-27 13:05:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 13:05:12,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:12,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:12,371 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash -65352657, now seen corresponding path program 1 times [2019-12-27 13:05:12,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:12,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725043003] [2019-12-27 13:05:12,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:12,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725043003] [2019-12-27 13:05:12,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:12,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:05:12,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279721986] [2019-12-27 13:05:12,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:05:12,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:12,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:05:12,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:05:12,432 INFO L87 Difference]: Start difference. First operand 56662 states and 158140 transitions. Second operand 5 states. [2019-12-27 13:05:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:13,509 INFO L93 Difference]: Finished difference Result 64151 states and 176361 transitions. [2019-12-27 13:05:13,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:05:13,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-27 13:05:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:14,002 INFO L225 Difference]: With dead ends: 64151 [2019-12-27 13:05:14,003 INFO L226 Difference]: Without dead ends: 64151 [2019-12-27 13:05:14,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64151 states. [2019-12-27 13:05:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64151 to 61941. [2019-12-27 13:05:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61941 states. [2019-12-27 13:05:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61941 states to 61941 states and 171191 transitions. [2019-12-27 13:05:15,302 INFO L78 Accepts]: Start accepts. Automaton has 61941 states and 171191 transitions. Word has length 84 [2019-12-27 13:05:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:15,303 INFO L462 AbstractCegarLoop]: Abstraction has 61941 states and 171191 transitions. [2019-12-27 13:05:15,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:05:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 61941 states and 171191 transitions. [2019-12-27 13:05:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 13:05:15,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:15,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:15,333 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1179411824, now seen corresponding path program 1 times [2019-12-27 13:05:15,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:15,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909578499] [2019-12-27 13:05:15,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:15,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909578499] [2019-12-27 13:05:15,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:15,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:05:15,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556675453] [2019-12-27 13:05:15,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:05:15,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:15,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:05:15,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:05:15,458 INFO L87 Difference]: Start difference. First operand 61941 states and 171191 transitions. Second operand 8 states. [2019-12-27 13:05:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:18,104 INFO L93 Difference]: Finished difference Result 99818 states and 275787 transitions. [2019-12-27 13:05:18,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 13:05:18,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-27 13:05:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:18,266 INFO L225 Difference]: With dead ends: 99818 [2019-12-27 13:05:18,266 INFO L226 Difference]: Without dead ends: 99500 [2019-12-27 13:05:18,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 13:05:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99500 states. [2019-12-27 13:05:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99500 to 83793. [2019-12-27 13:05:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83793 states. [2019-12-27 13:05:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83793 states to 83793 states and 231549 transitions. [2019-12-27 13:05:19,388 INFO L78 Accepts]: Start accepts. Automaton has 83793 states and 231549 transitions. Word has length 84 [2019-12-27 13:05:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:19,389 INFO L462 AbstractCegarLoop]: Abstraction has 83793 states and 231549 transitions. [2019-12-27 13:05:19,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:05:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 83793 states and 231549 transitions. [2019-12-27 13:05:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 13:05:19,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:19,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:19,425 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:19,426 INFO L82 PathProgramCache]: Analyzing trace with hash -617539535, now seen corresponding path program 1 times [2019-12-27 13:05:19,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:19,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255669784] [2019-12-27 13:05:19,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:19,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255669784] [2019-12-27 13:05:19,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:19,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:05:19,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487665117] [2019-12-27 13:05:19,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:05:19,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:19,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:05:19,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:05:19,531 INFO L87 Difference]: Start difference. First operand 83793 states and 231549 transitions. Second operand 8 states. [2019-12-27 13:05:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:22,662 INFO L93 Difference]: Finished difference Result 178613 states and 505336 transitions. [2019-12-27 13:05:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 13:05:22,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-27 13:05:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:22,972 INFO L225 Difference]: With dead ends: 178613 [2019-12-27 13:05:22,972 INFO L226 Difference]: Without dead ends: 178505 [2019-12-27 13:05:22,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2019-12-27 13:05:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178505 states. [2019-12-27 13:05:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178505 to 110513. [2019-12-27 13:05:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110513 states. [2019-12-27 13:05:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110513 states to 110513 states and 311403 transitions. [2019-12-27 13:05:25,511 INFO L78 Accepts]: Start accepts. Automaton has 110513 states and 311403 transitions. Word has length 84 [2019-12-27 13:05:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:25,512 INFO L462 AbstractCegarLoop]: Abstraction has 110513 states and 311403 transitions. [2019-12-27 13:05:25,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:05:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 110513 states and 311403 transitions. [2019-12-27 13:05:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 13:05:25,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:25,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:25,564 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:25,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash 269964146, now seen corresponding path program 1 times [2019-12-27 13:05:25,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:25,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035178616] [2019-12-27 13:05:25,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:25,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035178616] [2019-12-27 13:05:25,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:25,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:05:25,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437225133] [2019-12-27 13:05:25,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:05:25,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:05:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:05:25,646 INFO L87 Difference]: Start difference. First operand 110513 states and 311403 transitions. Second operand 5 states. [2019-12-27 13:05:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:25,816 INFO L93 Difference]: Finished difference Result 45095 states and 107744 transitions. [2019-12-27 13:05:25,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:05:25,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-27 13:05:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:25,864 INFO L225 Difference]: With dead ends: 45095 [2019-12-27 13:05:25,864 INFO L226 Difference]: Without dead ends: 39743 [2019-12-27 13:05:25,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-27 13:05:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39743 states. [2019-12-27 13:05:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39743 to 32550. [2019-12-27 13:05:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32550 states. [2019-12-27 13:05:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32550 states to 32550 states and 77200 transitions. [2019-12-27 13:05:26,835 INFO L78 Accepts]: Start accepts. Automaton has 32550 states and 77200 transitions. Word has length 84 [2019-12-27 13:05:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:26,835 INFO L462 AbstractCegarLoop]: Abstraction has 32550 states and 77200 transitions. [2019-12-27 13:05:26,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:05:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 32550 states and 77200 transitions. [2019-12-27 13:05:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-27 13:05:26,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:26,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:26,867 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1633083230, now seen corresponding path program 1 times [2019-12-27 13:05:26,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:26,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413439804] [2019-12-27 13:05:26,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:26,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413439804] [2019-12-27 13:05:27,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:27,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:05:27,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155078530] [2019-12-27 13:05:27,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:05:27,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:27,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:05:27,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:27,003 INFO L87 Difference]: Start difference. First operand 32550 states and 77200 transitions. Second operand 7 states. [2019-12-27 13:05:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:27,686 INFO L93 Difference]: Finished difference Result 43587 states and 100851 transitions. [2019-12-27 13:05:27,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:05:27,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-27 13:05:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:27,761 INFO L225 Difference]: With dead ends: 43587 [2019-12-27 13:05:27,761 INFO L226 Difference]: Without dead ends: 43529 [2019-12-27 13:05:27,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:05:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43529 states. [2019-12-27 13:05:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43529 to 34140. [2019-12-27 13:05:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34140 states. [2019-12-27 13:05:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34140 states to 34140 states and 79729 transitions. [2019-12-27 13:05:28,241 INFO L78 Accepts]: Start accepts. Automaton has 34140 states and 79729 transitions. Word has length 112 [2019-12-27 13:05:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:28,241 INFO L462 AbstractCegarLoop]: Abstraction has 34140 states and 79729 transitions. [2019-12-27 13:05:28,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:05:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 34140 states and 79729 transitions. [2019-12-27 13:05:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-27 13:05:28,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:28,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:28,275 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:28,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:28,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1516270661, now seen corresponding path program 1 times [2019-12-27 13:05:28,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:28,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438817403] [2019-12-27 13:05:28,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:28,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438817403] [2019-12-27 13:05:28,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:28,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:05:28,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63709512] [2019-12-27 13:05:28,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:05:28,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:05:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:05:28,342 INFO L87 Difference]: Start difference. First operand 34140 states and 79729 transitions. Second operand 5 states. [2019-12-27 13:05:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:28,823 INFO L93 Difference]: Finished difference Result 35958 states and 83701 transitions. [2019-12-27 13:05:28,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:05:28,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-12-27 13:05:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:28,866 INFO L225 Difference]: With dead ends: 35958 [2019-12-27 13:05:28,866 INFO L226 Difference]: Without dead ends: 35896 [2019-12-27 13:05:28,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:05:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35896 states. [2019-12-27 13:05:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35896 to 34146. [2019-12-27 13:05:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34146 states. [2019-12-27 13:05:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34146 states to 34146 states and 79742 transitions. [2019-12-27 13:05:29,257 INFO L78 Accepts]: Start accepts. Automaton has 34146 states and 79742 transitions. Word has length 112 [2019-12-27 13:05:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:29,257 INFO L462 AbstractCegarLoop]: Abstraction has 34146 states and 79742 transitions. [2019-12-27 13:05:29,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:05:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34146 states and 79742 transitions. [2019-12-27 13:05:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-27 13:05:29,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:29,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:29,288 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:29,288 INFO L82 PathProgramCache]: Analyzing trace with hash 843036348, now seen corresponding path program 2 times [2019-12-27 13:05:29,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:29,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792846431] [2019-12-27 13:05:29,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:29,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792846431] [2019-12-27 13:05:29,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:29,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:05:29,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141159359] [2019-12-27 13:05:29,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:05:29,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:29,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:05:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:29,419 INFO L87 Difference]: Start difference. First operand 34146 states and 79742 transitions. Second operand 7 states. [2019-12-27 13:05:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:30,289 INFO L93 Difference]: Finished difference Result 45199 states and 102865 transitions. [2019-12-27 13:05:30,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 13:05:30,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-27 13:05:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:30,339 INFO L225 Difference]: With dead ends: 45199 [2019-12-27 13:05:30,339 INFO L226 Difference]: Without dead ends: 45199 [2019-12-27 13:05:30,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:05:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45199 states. [2019-12-27 13:05:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45199 to 38168. [2019-12-27 13:05:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38168 states. [2019-12-27 13:05:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38168 states to 38168 states and 87539 transitions. [2019-12-27 13:05:30,818 INFO L78 Accepts]: Start accepts. Automaton has 38168 states and 87539 transitions. Word has length 112 [2019-12-27 13:05:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:30,818 INFO L462 AbstractCegarLoop]: Abstraction has 38168 states and 87539 transitions. [2019-12-27 13:05:30,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:05:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38168 states and 87539 transitions. [2019-12-27 13:05:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-27 13:05:30,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:30,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:30,854 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash -79647235, now seen corresponding path program 1 times [2019-12-27 13:05:30,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:30,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620372270] [2019-12-27 13:05:30,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:30,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620372270] [2019-12-27 13:05:30,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:30,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:05:30,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472476870] [2019-12-27 13:05:30,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:05:30,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:05:30,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:05:30,939 INFO L87 Difference]: Start difference. First operand 38168 states and 87539 transitions. Second operand 5 states. [2019-12-27 13:05:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:31,259 INFO L93 Difference]: Finished difference Result 43450 states and 99209 transitions. [2019-12-27 13:05:31,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:05:31,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-12-27 13:05:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:31,343 INFO L225 Difference]: With dead ends: 43450 [2019-12-27 13:05:31,343 INFO L226 Difference]: Without dead ends: 43450 [2019-12-27 13:05:31,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43450 states. [2019-12-27 13:05:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43450 to 35145. [2019-12-27 13:05:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35145 states. [2019-12-27 13:05:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35145 states to 35145 states and 80302 transitions. [2019-12-27 13:05:32,093 INFO L78 Accepts]: Start accepts. Automaton has 35145 states and 80302 transitions. Word has length 112 [2019-12-27 13:05:32,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:32,093 INFO L462 AbstractCegarLoop]: Abstraction has 35145 states and 80302 transitions. [2019-12-27 13:05:32,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:05:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 35145 states and 80302 transitions. [2019-12-27 13:05:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-27 13:05:32,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:32,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:32,133 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1819828379, now seen corresponding path program 1 times [2019-12-27 13:05:32,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:32,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086639460] [2019-12-27 13:05:32,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:32,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086639460] [2019-12-27 13:05:32,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:32,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:05:32,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197354144] [2019-12-27 13:05:32,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:05:32,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:32,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:05:32,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:05:32,207 INFO L87 Difference]: Start difference. First operand 35145 states and 80302 transitions. Second operand 6 states. [2019-12-27 13:05:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:32,888 INFO L93 Difference]: Finished difference Result 38722 states and 88056 transitions. [2019-12-27 13:05:32,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:05:32,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-12-27 13:05:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:32,931 INFO L225 Difference]: With dead ends: 38722 [2019-12-27 13:05:32,931 INFO L226 Difference]: Without dead ends: 38616 [2019-12-27 13:05:32,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:05:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38616 states. [2019-12-27 13:05:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38616 to 35120. [2019-12-27 13:05:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35120 states. [2019-12-27 13:05:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35120 states to 35120 states and 80155 transitions. [2019-12-27 13:05:33,492 INFO L78 Accepts]: Start accepts. Automaton has 35120 states and 80155 transitions. Word has length 112 [2019-12-27 13:05:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:33,492 INFO L462 AbstractCegarLoop]: Abstraction has 35120 states and 80155 transitions. [2019-12-27 13:05:33,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:05:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 35120 states and 80155 transitions. [2019-12-27 13:05:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-27 13:05:33,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:33,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:33,531 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:33,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:33,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1007934813, now seen corresponding path program 1 times [2019-12-27 13:05:33,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:33,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297237934] [2019-12-27 13:05:33,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:33,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297237934] [2019-12-27 13:05:33,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:33,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:05:33,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586408085] [2019-12-27 13:05:33,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:05:33,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:33,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:05:33,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:05:33,657 INFO L87 Difference]: Start difference. First operand 35120 states and 80155 transitions. Second operand 8 states. [2019-12-27 13:05:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:34,736 INFO L93 Difference]: Finished difference Result 47319 states and 107707 transitions. [2019-12-27 13:05:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 13:05:34,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-12-27 13:05:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:34,788 INFO L225 Difference]: With dead ends: 47319 [2019-12-27 13:05:34,788 INFO L226 Difference]: Without dead ends: 47301 [2019-12-27 13:05:34,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 13:05:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47301 states. [2019-12-27 13:05:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47301 to 42192. [2019-12-27 13:05:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42192 states. [2019-12-27 13:05:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42192 states to 42192 states and 96279 transitions. [2019-12-27 13:05:35,274 INFO L78 Accepts]: Start accepts. Automaton has 42192 states and 96279 transitions. Word has length 112 [2019-12-27 13:05:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:35,274 INFO L462 AbstractCegarLoop]: Abstraction has 42192 states and 96279 transitions. [2019-12-27 13:05:35,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:05:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 42192 states and 96279 transitions. [2019-12-27 13:05:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-27 13:05:35,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:35,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:35,310 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1917382491, now seen corresponding path program 1 times [2019-12-27 13:05:35,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:35,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711937079] [2019-12-27 13:05:35,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:35,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711937079] [2019-12-27 13:05:35,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:35,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:05:35,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306906450] [2019-12-27 13:05:35,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:05:35,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:35,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:05:35,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:35,439 INFO L87 Difference]: Start difference. First operand 42192 states and 96279 transitions. Second operand 7 states. [2019-12-27 13:05:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:35,850 INFO L93 Difference]: Finished difference Result 49714 states and 111889 transitions. [2019-12-27 13:05:35,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:05:35,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-27 13:05:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:35,918 INFO L225 Difference]: With dead ends: 49714 [2019-12-27 13:05:35,919 INFO L226 Difference]: Without dead ends: 49714 [2019-12-27 13:05:35,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:05:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49714 states. [2019-12-27 13:05:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49714 to 42742. [2019-12-27 13:05:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42742 states. [2019-12-27 13:05:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42742 states to 42742 states and 96720 transitions. [2019-12-27 13:05:36,619 INFO L78 Accepts]: Start accepts. Automaton has 42742 states and 96720 transitions. Word has length 112 [2019-12-27 13:05:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:36,619 INFO L462 AbstractCegarLoop]: Abstraction has 42742 states and 96720 transitions. [2019-12-27 13:05:36,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:05:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 42742 states and 96720 transitions. [2019-12-27 13:05:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-27 13:05:36,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:36,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:36,657 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:36,657 INFO L82 PathProgramCache]: Analyzing trace with hash 645609253, now seen corresponding path program 1 times [2019-12-27 13:05:36,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:36,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865284823] [2019-12-27 13:05:36,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:36,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865284823] [2019-12-27 13:05:36,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:36,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:05:36,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617391635] [2019-12-27 13:05:36,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:05:36,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:05:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:05:36,760 INFO L87 Difference]: Start difference. First operand 42742 states and 96720 transitions. Second operand 6 states. [2019-12-27 13:05:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:36,992 INFO L93 Difference]: Finished difference Result 42589 states and 96210 transitions. [2019-12-27 13:05:36,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:05:36,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-12-27 13:05:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:37,037 INFO L225 Difference]: With dead ends: 42589 [2019-12-27 13:05:37,037 INFO L226 Difference]: Without dead ends: 42589 [2019-12-27 13:05:37,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:05:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42589 states. [2019-12-27 13:05:37,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42589 to 31613. [2019-12-27 13:05:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31613 states. [2019-12-27 13:05:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31613 states to 31613 states and 71588 transitions. [2019-12-27 13:05:37,463 INFO L78 Accepts]: Start accepts. Automaton has 31613 states and 71588 transitions. Word has length 112 [2019-12-27 13:05:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:37,464 INFO L462 AbstractCegarLoop]: Abstraction has 31613 states and 71588 transitions. [2019-12-27 13:05:37,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:05:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 31613 states and 71588 transitions. [2019-12-27 13:05:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:37,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:37,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:37,490 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:37,490 INFO L82 PathProgramCache]: Analyzing trace with hash -333774747, now seen corresponding path program 1 times [2019-12-27 13:05:37,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:37,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550457548] [2019-12-27 13:05:37,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:37,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550457548] [2019-12-27 13:05:37,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:37,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:05:37,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54517623] [2019-12-27 13:05:37,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:05:37,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:37,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:05:37,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:37,584 INFO L87 Difference]: Start difference. First operand 31613 states and 71588 transitions. Second operand 7 states. [2019-12-27 13:05:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:38,134 INFO L93 Difference]: Finished difference Result 36799 states and 83106 transitions. [2019-12-27 13:05:38,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:05:38,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2019-12-27 13:05:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:38,174 INFO L225 Difference]: With dead ends: 36799 [2019-12-27 13:05:38,175 INFO L226 Difference]: Without dead ends: 36799 [2019-12-27 13:05:38,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:05:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36799 states. [2019-12-27 13:05:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36799 to 34137. [2019-12-27 13:05:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34137 states. [2019-12-27 13:05:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34137 states to 34137 states and 77448 transitions. [2019-12-27 13:05:38,566 INFO L78 Accepts]: Start accepts. Automaton has 34137 states and 77448 transitions. Word has length 114 [2019-12-27 13:05:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:38,566 INFO L462 AbstractCegarLoop]: Abstraction has 34137 states and 77448 transitions. [2019-12-27 13:05:38,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:05:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 34137 states and 77448 transitions. [2019-12-27 13:05:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:38,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:38,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:38,594 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1660322440, now seen corresponding path program 1 times [2019-12-27 13:05:38,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:38,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432024103] [2019-12-27 13:05:38,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:38,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432024103] [2019-12-27 13:05:38,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:38,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:05:38,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773503811] [2019-12-27 13:05:38,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:05:38,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:05:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:05:38,742 INFO L87 Difference]: Start difference. First operand 34137 states and 77448 transitions. Second operand 5 states. [2019-12-27 13:05:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:38,992 INFO L93 Difference]: Finished difference Result 34137 states and 77439 transitions. [2019-12-27 13:05:38,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:05:38,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-27 13:05:38,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:39,026 INFO L225 Difference]: With dead ends: 34137 [2019-12-27 13:05:39,026 INFO L226 Difference]: Without dead ends: 34137 [2019-12-27 13:05:39,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:05:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34137 states. [2019-12-27 13:05:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34137 to 34137. [2019-12-27 13:05:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34137 states. [2019-12-27 13:05:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34137 states to 34137 states and 77439 transitions. [2019-12-27 13:05:39,347 INFO L78 Accepts]: Start accepts. Automaton has 34137 states and 77439 transitions. Word has length 114 [2019-12-27 13:05:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:39,347 INFO L462 AbstractCegarLoop]: Abstraction has 34137 states and 77439 transitions. [2019-12-27 13:05:39,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:05:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 34137 states and 77439 transitions. [2019-12-27 13:05:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:39,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:39,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:39,379 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:39,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1747141175, now seen corresponding path program 1 times [2019-12-27 13:05:39,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:39,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651834199] [2019-12-27 13:05:39,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:39,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651834199] [2019-12-27 13:05:39,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:39,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:05:39,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967918084] [2019-12-27 13:05:39,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:05:39,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:05:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:05:39,464 INFO L87 Difference]: Start difference. First operand 34137 states and 77439 transitions. Second operand 4 states. [2019-12-27 13:05:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:39,816 INFO L93 Difference]: Finished difference Result 36228 states and 82028 transitions. [2019-12-27 13:05:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:05:39,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-27 13:05:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:39,854 INFO L225 Difference]: With dead ends: 36228 [2019-12-27 13:05:39,854 INFO L226 Difference]: Without dead ends: 36228 [2019-12-27 13:05:39,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:05:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36228 states. [2019-12-27 13:05:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36228 to 33283. [2019-12-27 13:05:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33283 states. [2019-12-27 13:05:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33283 states to 33283 states and 75508 transitions. [2019-12-27 13:05:40,215 INFO L78 Accepts]: Start accepts. Automaton has 33283 states and 75508 transitions. Word has length 114 [2019-12-27 13:05:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:40,215 INFO L462 AbstractCegarLoop]: Abstraction has 33283 states and 75508 transitions. [2019-12-27 13:05:40,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:05:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 33283 states and 75508 transitions. [2019-12-27 13:05:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:40,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:40,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:40,244 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:40,244 INFO L82 PathProgramCache]: Analyzing trace with hash -207576506, now seen corresponding path program 1 times [2019-12-27 13:05:40,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:40,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462210768] [2019-12-27 13:05:40,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:40,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462210768] [2019-12-27 13:05:40,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:40,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:05:40,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968726637] [2019-12-27 13:05:40,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:05:40,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:05:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:40,337 INFO L87 Difference]: Start difference. First operand 33283 states and 75508 transitions. Second operand 7 states. [2019-12-27 13:05:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:40,735 INFO L93 Difference]: Finished difference Result 34058 states and 77357 transitions. [2019-12-27 13:05:40,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:05:40,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2019-12-27 13:05:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:40,770 INFO L225 Difference]: With dead ends: 34058 [2019-12-27 13:05:40,770 INFO L226 Difference]: Without dead ends: 34058 [2019-12-27 13:05:40,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:05:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34058 states. [2019-12-27 13:05:41,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34058 to 32796. [2019-12-27 13:05:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32796 states. [2019-12-27 13:05:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32796 states to 32796 states and 74427 transitions. [2019-12-27 13:05:41,138 INFO L78 Accepts]: Start accepts. Automaton has 32796 states and 74427 transitions. Word has length 114 [2019-12-27 13:05:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:41,139 INFO L462 AbstractCegarLoop]: Abstraction has 32796 states and 74427 transitions. [2019-12-27 13:05:41,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:05:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 32796 states and 74427 transitions. [2019-12-27 13:05:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:41,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:41,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:41,170 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:41,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash -160487065, now seen corresponding path program 2 times [2019-12-27 13:05:41,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:41,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759268787] [2019-12-27 13:05:41,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:41,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759268787] [2019-12-27 13:05:41,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:41,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:05:41,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248191992] [2019-12-27 13:05:41,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:05:41,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:41,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:05:41,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:05:41,280 INFO L87 Difference]: Start difference. First operand 32796 states and 74427 transitions. Second operand 6 states. [2019-12-27 13:05:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:41,851 INFO L93 Difference]: Finished difference Result 35979 states and 81385 transitions. [2019-12-27 13:05:41,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:05:41,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-27 13:05:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:41,886 INFO L225 Difference]: With dead ends: 35979 [2019-12-27 13:05:41,886 INFO L226 Difference]: Without dead ends: 35979 [2019-12-27 13:05:41,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35979 states. [2019-12-27 13:05:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35979 to 32753. [2019-12-27 13:05:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32753 states. [2019-12-27 13:05:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32753 states to 32753 states and 74252 transitions. [2019-12-27 13:05:42,220 INFO L78 Accepts]: Start accepts. Automaton has 32753 states and 74252 transitions. Word has length 114 [2019-12-27 13:05:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:42,220 INFO L462 AbstractCegarLoop]: Abstraction has 32753 states and 74252 transitions. [2019-12-27 13:05:42,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:05:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 32753 states and 74252 transitions. [2019-12-27 13:05:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:42,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:42,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:42,248 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1517791349, now seen corresponding path program 3 times [2019-12-27 13:05:42,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:42,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634676978] [2019-12-27 13:05:42,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:42,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634676978] [2019-12-27 13:05:42,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:42,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:05:42,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341809462] [2019-12-27 13:05:42,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:05:42,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:42,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:05:42,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:05:42,301 INFO L87 Difference]: Start difference. First operand 32753 states and 74252 transitions. Second operand 3 states. [2019-12-27 13:05:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:42,432 INFO L93 Difference]: Finished difference Result 41132 states and 92435 transitions. [2019-12-27 13:05:42,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:05:42,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-12-27 13:05:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:42,475 INFO L225 Difference]: With dead ends: 41132 [2019-12-27 13:05:42,475 INFO L226 Difference]: Without dead ends: 41132 [2019-12-27 13:05:42,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:05:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41132 states. [2019-12-27 13:05:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41132 to 40765. [2019-12-27 13:05:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40765 states. [2019-12-27 13:05:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40765 states to 40765 states and 91645 transitions. [2019-12-27 13:05:42,917 INFO L78 Accepts]: Start accepts. Automaton has 40765 states and 91645 transitions. Word has length 114 [2019-12-27 13:05:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:42,920 INFO L462 AbstractCegarLoop]: Abstraction has 40765 states and 91645 transitions. [2019-12-27 13:05:42,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:05:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40765 states and 91645 transitions. [2019-12-27 13:05:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:42,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:42,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:42,971 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:42,971 INFO L82 PathProgramCache]: Analyzing trace with hash -665885578, now seen corresponding path program 1 times [2019-12-27 13:05:42,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:42,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325875123] [2019-12-27 13:05:42,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:43,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325875123] [2019-12-27 13:05:43,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:43,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:05:43,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803758059] [2019-12-27 13:05:43,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:05:43,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:43,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:05:43,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:05:43,122 INFO L87 Difference]: Start difference. First operand 40765 states and 91645 transitions. Second operand 8 states. [2019-12-27 13:05:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:43,872 INFO L93 Difference]: Finished difference Result 48646 states and 108944 transitions. [2019-12-27 13:05:43,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:05:43,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-12-27 13:05:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:43,924 INFO L225 Difference]: With dead ends: 48646 [2019-12-27 13:05:43,924 INFO L226 Difference]: Without dead ends: 48646 [2019-12-27 13:05:43,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:05:43,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48646 states. [2019-12-27 13:05:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48646 to 42736. [2019-12-27 13:05:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42736 states. [2019-12-27 13:05:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42736 states to 42736 states and 95979 transitions. [2019-12-27 13:05:44,718 INFO L78 Accepts]: Start accepts. Automaton has 42736 states and 95979 transitions. Word has length 114 [2019-12-27 13:05:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:44,718 INFO L462 AbstractCegarLoop]: Abstraction has 42736 states and 95979 transitions. [2019-12-27 13:05:44,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:05:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 42736 states and 95979 transitions. [2019-12-27 13:05:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:44,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:44,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:44,756 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1079723378, now seen corresponding path program 1 times [2019-12-27 13:05:44,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:44,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312396468] [2019-12-27 13:05:44,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:44,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312396468] [2019-12-27 13:05:44,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:44,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:05:44,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546236540] [2019-12-27 13:05:44,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:05:44,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:44,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:05:44,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:05:44,864 INFO L87 Difference]: Start difference. First operand 42736 states and 95979 transitions. Second operand 6 states. [2019-12-27 13:05:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:45,451 INFO L93 Difference]: Finished difference Result 47483 states and 106810 transitions. [2019-12-27 13:05:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:05:45,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-27 13:05:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:45,503 INFO L225 Difference]: With dead ends: 47483 [2019-12-27 13:05:45,503 INFO L226 Difference]: Without dead ends: 47483 [2019-12-27 13:05:45,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:05:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47483 states. [2019-12-27 13:05:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47483 to 42238. [2019-12-27 13:05:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42238 states. [2019-12-27 13:05:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42238 states to 42238 states and 94881 transitions. [2019-12-27 13:05:45,974 INFO L78 Accepts]: Start accepts. Automaton has 42238 states and 94881 transitions. Word has length 114 [2019-12-27 13:05:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:45,974 INFO L462 AbstractCegarLoop]: Abstraction has 42238 states and 94881 transitions. [2019-12-27 13:05:45,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:05:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 42238 states and 94881 transitions. [2019-12-27 13:05:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:46,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:46,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:46,008 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash 598555036, now seen corresponding path program 2 times [2019-12-27 13:05:46,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:46,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790269550] [2019-12-27 13:05:46,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:46,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790269550] [2019-12-27 13:05:46,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:46,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:05:46,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553165012] [2019-12-27 13:05:46,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:05:46,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:46,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:05:46,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:05:46,162 INFO L87 Difference]: Start difference. First operand 42238 states and 94881 transitions. Second operand 8 states. [2019-12-27 13:05:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:46,950 INFO L93 Difference]: Finished difference Result 50294 states and 112863 transitions. [2019-12-27 13:05:46,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:05:46,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-12-27 13:05:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:47,008 INFO L225 Difference]: With dead ends: 50294 [2019-12-27 13:05:47,009 INFO L226 Difference]: Without dead ends: 50294 [2019-12-27 13:05:47,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:05:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50294 states. [2019-12-27 13:05:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50294 to 40967. [2019-12-27 13:05:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40967 states. [2019-12-27 13:05:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40967 states to 40967 states and 92041 transitions. [2019-12-27 13:05:47,488 INFO L78 Accepts]: Start accepts. Automaton has 40967 states and 92041 transitions. Word has length 114 [2019-12-27 13:05:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:47,488 INFO L462 AbstractCegarLoop]: Abstraction has 40967 states and 92041 transitions. [2019-12-27 13:05:47,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:05:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 40967 states and 92041 transitions. [2019-12-27 13:05:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:47,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:47,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:47,522 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:47,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:47,522 INFO L82 PathProgramCache]: Analyzing trace with hash -432842779, now seen corresponding path program 4 times [2019-12-27 13:05:47,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:47,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114181793] [2019-12-27 13:05:47,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:47,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114181793] [2019-12-27 13:05:47,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:47,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:05:47,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207389756] [2019-12-27 13:05:47,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:05:47,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:47,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:05:47,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:05:47,637 INFO L87 Difference]: Start difference. First operand 40967 states and 92041 transitions. Second operand 8 states. [2019-12-27 13:05:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:49,046 INFO L93 Difference]: Finished difference Result 56137 states and 126963 transitions. [2019-12-27 13:05:49,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:05:49,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-12-27 13:05:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:49,109 INFO L225 Difference]: With dead ends: 56137 [2019-12-27 13:05:49,109 INFO L226 Difference]: Without dead ends: 56137 [2019-12-27 13:05:49,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-27 13:05:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56137 states. [2019-12-27 13:05:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56137 to 40633. [2019-12-27 13:05:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40633 states. [2019-12-27 13:05:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40633 states to 40633 states and 91335 transitions. [2019-12-27 13:05:49,629 INFO L78 Accepts]: Start accepts. Automaton has 40633 states and 91335 transitions. Word has length 114 [2019-12-27 13:05:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:49,630 INFO L462 AbstractCegarLoop]: Abstraction has 40633 states and 91335 transitions. [2019-12-27 13:05:49,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:05:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 40633 states and 91335 transitions. [2019-12-27 13:05:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:49,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:49,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:49,663 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash -977113266, now seen corresponding path program 2 times [2019-12-27 13:05:49,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:49,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057082284] [2019-12-27 13:05:49,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:49,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057082284] [2019-12-27 13:05:49,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:49,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:05:49,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150547444] [2019-12-27 13:05:49,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:05:49,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:49,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:05:49,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:05:49,733 INFO L87 Difference]: Start difference. First operand 40633 states and 91335 transitions. Second operand 5 states. [2019-12-27 13:05:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:50,240 INFO L93 Difference]: Finished difference Result 41775 states and 93684 transitions. [2019-12-27 13:05:50,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:05:50,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-27 13:05:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:50,313 INFO L225 Difference]: With dead ends: 41775 [2019-12-27 13:05:50,313 INFO L226 Difference]: Without dead ends: 41775 [2019-12-27 13:05:50,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:05:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41775 states. [2019-12-27 13:05:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41775 to 40781. [2019-12-27 13:05:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40781 states. [2019-12-27 13:05:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40781 states to 40781 states and 91643 transitions. [2019-12-27 13:05:50,866 INFO L78 Accepts]: Start accepts. Automaton has 40781 states and 91643 transitions. Word has length 114 [2019-12-27 13:05:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:50,867 INFO L462 AbstractCegarLoop]: Abstraction has 40781 states and 91643 transitions. [2019-12-27 13:05:50,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:05:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 40781 states and 91643 transitions. [2019-12-27 13:05:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 13:05:50,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:50,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:50,905 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:50,906 INFO L82 PathProgramCache]: Analyzing trace with hash 448032188, now seen corresponding path program 3 times [2019-12-27 13:05:50,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:50,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654894908] [2019-12-27 13:05:50,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:50,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654894908] [2019-12-27 13:05:50,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:50,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:05:50,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825278524] [2019-12-27 13:05:50,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:05:50,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:50,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:05:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:05:50,984 INFO L87 Difference]: Start difference. First operand 40781 states and 91643 transitions. Second operand 6 states. [2019-12-27 13:05:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:51,752 INFO L93 Difference]: Finished difference Result 43549 states and 97411 transitions. [2019-12-27 13:05:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:05:51,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-27 13:05:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:51,817 INFO L225 Difference]: With dead ends: 43549 [2019-12-27 13:05:51,817 INFO L226 Difference]: Without dead ends: 43531 [2019-12-27 13:05:51,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:05:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43531 states. [2019-12-27 13:05:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43531 to 41136. [2019-12-27 13:05:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41136 states. [2019-12-27 13:05:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41136 states to 41136 states and 92404 transitions. [2019-12-27 13:05:52,479 INFO L78 Accepts]: Start accepts. Automaton has 41136 states and 92404 transitions. Word has length 114 [2019-12-27 13:05:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:52,479 INFO L462 AbstractCegarLoop]: Abstraction has 41136 states and 92404 transitions. [2019-12-27 13:05:52,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:05:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 41136 states and 92404 transitions. [2019-12-27 13:05:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-27 13:05:52,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:52,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:52,516 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1850989116, now seen corresponding path program 1 times [2019-12-27 13:05:52,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:52,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71444402] [2019-12-27 13:05:52,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:05:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:05:52,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71444402] [2019-12-27 13:05:52,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:05:52,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 13:05:52,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648450956] [2019-12-27 13:05:52,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 13:05:52,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:05:52,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 13:05:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:05:52,671 INFO L87 Difference]: Start difference. First operand 41136 states and 92404 transitions. Second operand 11 states. [2019-12-27 13:05:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:05:53,356 INFO L93 Difference]: Finished difference Result 65495 states and 147510 transitions. [2019-12-27 13:05:53,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 13:05:53,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-12-27 13:05:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:05:53,420 INFO L225 Difference]: With dead ends: 65495 [2019-12-27 13:05:53,420 INFO L226 Difference]: Without dead ends: 59131 [2019-12-27 13:05:53,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2019-12-27 13:05:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59131 states. [2019-12-27 13:05:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59131 to 43917. [2019-12-27 13:05:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43917 states. [2019-12-27 13:05:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43917 states to 43917 states and 98399 transitions. [2019-12-27 13:05:53,976 INFO L78 Accepts]: Start accepts. Automaton has 43917 states and 98399 transitions. Word has length 116 [2019-12-27 13:05:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:05:53,976 INFO L462 AbstractCegarLoop]: Abstraction has 43917 states and 98399 transitions. [2019-12-27 13:05:53,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 13:05:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 43917 states and 98399 transitions. [2019-12-27 13:05:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-27 13:05:54,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:05:54,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:05:54,017 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:05:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:05:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash 698796334, now seen corresponding path program 2 times [2019-12-27 13:05:54,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:05:54,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488661159] [2019-12-27 13:05:54,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:05:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:05:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:05:54,119 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 13:05:54,119 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 13:05:54,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:05:54 BasicIcfg [2019-12-27 13:05:54,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 13:05:54,352 INFO L168 Benchmark]: Toolchain (without parser) took 171804.56 ms. Allocated memory was 137.9 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 98.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 13:05:54,352 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 137.9 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 13:05:54,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.73 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 98.7 MB in the beginning and 151.2 MB in the end (delta: -52.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 13:05:54,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.35 ms. Allocated memory is still 200.3 MB. Free memory was 151.2 MB in the beginning and 147.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-12-27 13:05:54,353 INFO L168 Benchmark]: Boogie Preprocessor took 43.82 ms. Allocated memory is still 200.3 MB. Free memory was 147.5 MB in the beginning and 145.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 13:05:54,353 INFO L168 Benchmark]: RCFGBuilder took 1026.41 ms. Allocated memory is still 200.3 MB. Free memory was 145.3 MB in the beginning and 88.9 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2019-12-27 13:05:54,354 INFO L168 Benchmark]: TraceAbstraction took 169795.82 ms. Allocated memory was 200.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 88.2 MB in the beginning and 1.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 13:05:54,355 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.49 ms. Allocated memory is still 137.9 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 862.73 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 98.7 MB in the beginning and 151.2 MB in the end (delta: -52.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.35 ms. Allocated memory is still 200.3 MB. Free memory was 151.2 MB in the beginning and 147.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.82 ms. Allocated memory is still 200.3 MB. Free memory was 147.5 MB in the beginning and 145.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1026.41 ms. Allocated memory is still 200.3 MB. Free memory was 145.3 MB in the beginning and 88.9 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 169795.82 ms. Allocated memory was 200.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 88.2 MB in the beginning and 1.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L709] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L710] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L711] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L712] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L713] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L714] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L715] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L716] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L717] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L718] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L719] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L720] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L721] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L817] 0 pthread_t t1721; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] 0 pthread_t t1722; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L735] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L736] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L737] 1 x$r_buff0_thd1 = (_Bool)1 [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L830] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 169.3s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 74.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 18725 SDtfs, 19422 SDslu, 46870 SDs, 0 SdLazy, 18098 SolverSat, 891 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 133 SyntacticMatches, 38 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278543occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 76.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 370210 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3990 NumberOfCodeBlocks, 3990 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3831 ConstructedInterpolants, 0 QuantifiedInterpolants, 888033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...