/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/safe010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 04:34:05,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 04:34:05,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 04:34:05,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 04:34:05,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 04:34:05,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 04:34:05,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 04:34:05,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 04:34:05,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 04:34:05,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 04:34:05,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 04:34:05,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 04:34:05,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 04:34:05,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 04:34:05,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 04:34:05,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 04:34:05,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 04:34:05,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 04:34:05,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 04:34:05,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 04:34:05,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 04:34:05,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 04:34:05,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 04:34:05,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 04:34:05,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 04:34:05,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 04:34:05,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 04:34:05,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 04:34:05,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 04:34:05,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 04:34:05,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 04:34:05,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 04:34:05,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 04:34:05,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 04:34:05,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 04:34:05,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 04:34:05,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 04:34:05,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 04:34:05,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 04:34:05,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 04:34:05,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 04:34:05,338 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-19 04:34:05,352 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 04:34:05,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 04:34:05,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 04:34:05,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 04:34:05,354 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 04:34:05,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 04:34:05,354 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 04:34:05,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 04:34:05,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 04:34:05,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 04:34:05,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 04:34:05,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 04:34:05,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 04:34:05,357 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 04:34:05,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 04:34:05,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 04:34:05,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 04:34:05,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 04:34:05,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 04:34:05,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 04:34:05,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 04:34:05,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:34:05,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 04:34:05,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 04:34:05,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 04:34:05,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 04:34:05,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 04:34:05,361 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 04:34:05,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 04:34:05,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 04:34:05,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 04:34:05,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 04:34:05,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 04:34:05,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 04:34:05,756 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 04:34:05,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2019-12-19 04:34:05,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf1f7f37/4a0366cc36cc4409a04b70529f5c7be6/FLAG36a86871b [2019-12-19 04:34:06,325 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 04:34:06,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2019-12-19 04:34:06,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf1f7f37/4a0366cc36cc4409a04b70529f5c7be6/FLAG36a86871b [2019-12-19 04:34:06,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf1f7f37/4a0366cc36cc4409a04b70529f5c7be6 [2019-12-19 04:34:06,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 04:34:06,685 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 04:34:06,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 04:34:06,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 04:34:06,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 04:34:06,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:34:06" (1/1) ... [2019-12-19 04:34:06,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3189ba63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:06, skipping insertion in model container [2019-12-19 04:34:06,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:34:06" (1/1) ... [2019-12-19 04:34:06,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 04:34:06,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 04:34:07,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:34:07,433 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 04:34:07,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:34:07,658 INFO L208 MainTranslator]: Completed translation [2019-12-19 04:34:07,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07 WrapperNode [2019-12-19 04:34:07,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 04:34:07,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 04:34:07,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 04:34:07,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 04:34:07,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... [2019-12-19 04:34:07,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... [2019-12-19 04:34:07,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 04:34:07,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 04:34:07,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 04:34:07,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 04:34:07,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... [2019-12-19 04:34:07,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... [2019-12-19 04:34:07,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... [2019-12-19 04:34:07,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... [2019-12-19 04:34:07,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... [2019-12-19 04:34:07,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... [2019-12-19 04:34:07,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... [2019-12-19 04:34:07,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 04:34:07,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 04:34:07,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 04:34:07,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 04:34:07,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:34:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 04:34:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 04:34:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 04:34:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 04:34:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 04:34:07,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 04:34:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 04:34:07,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 04:34:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 04:34:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 04:34:07,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 04:34:07,878 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 04:34:08,606 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 04:34:08,606 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 04:34:08,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:34:08 BoogieIcfgContainer [2019-12-19 04:34:08,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 04:34:08,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 04:34:08,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 04:34:08,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 04:34:08,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:34:06" (1/3) ... [2019-12-19 04:34:08,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb06cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:34:08, skipping insertion in model container [2019-12-19 04:34:08,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:34:07" (2/3) ... [2019-12-19 04:34:08,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb06cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:34:08, skipping insertion in model container [2019-12-19 04:34:08,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:34:08" (3/3) ... [2019-12-19 04:34:08,617 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.opt.i [2019-12-19 04:34:08,628 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 04:34:08,628 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 04:34:08,636 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 04:34:08,637 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 04:34:08,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,675 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,675 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,683 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,683 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,696 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,696 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,697 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,700 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:34:08,719 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 04:34:08,738 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 04:34:08,738 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 04:34:08,738 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 04:34:08,738 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 04:34:08,739 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 04:34:08,739 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 04:34:08,739 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 04:34:08,739 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 04:34:08,776 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-19 04:34:10,153 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-19 04:34:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-19 04:34:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-19 04:34:10,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:10,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:10,166 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:10,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:10,173 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-19 04:34:10,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:10,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543865059] [2019-12-19 04:34:10,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:10,442 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-19 04:34:10,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543865059] [2019-12-19 04:34:10,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:10,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:10,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436854831] [2019-12-19 04:34:10,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:10,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:10,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:10,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:10,469 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-19 04:34:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:11,054 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-19 04:34:11,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:34:11,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-19 04:34:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:11,290 INFO L225 Difference]: With dead ends: 23454 [2019-12-19 04:34:11,290 INFO L226 Difference]: Without dead ends: 21278 [2019-12-19 04:34:11,292 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-19 04:34:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-19 04:34:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-19 04:34:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-19 04:34:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-19 04:34:13,454 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-19 04:34:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:13,455 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-19 04:34:13,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-19 04:34:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 04:34:13,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:13,461 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] [2019-12-19 04:34:13,462 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-19 04:34:13,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:13,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790652030] [2019-12-19 04:34:13,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:13,632 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-19 04:34:13,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790652030] [2019-12-19 04:34:13,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:13,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:13,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230337269] [2019-12-19 04:34:13,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:13,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:13,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:13,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:13,637 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-19 04:34:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:14,799 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-19 04:34:14,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:14,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 04:34:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:14,942 INFO L225 Difference]: With dead ends: 34712 [2019-12-19 04:34:14,943 INFO L226 Difference]: Without dead ends: 34568 [2019-12-19 04:34:14,943 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-19 04:34:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-19 04:34:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-19 04:34:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-19 04:34:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-19 04:34:17,333 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-19 04:34:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:17,335 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-19 04:34:17,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-19 04:34:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 04:34:17,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:17,339 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] [2019-12-19 04:34:17,340 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:17,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:17,340 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-19 04:34:17,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:17,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391961692] [2019-12-19 04:34:17,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:17,446 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-19 04:34:17,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391961692] [2019-12-19 04:34:17,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:17,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:17,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63659811] [2019-12-19 04:34:17,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:17,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:17,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:17,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:17,449 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-19 04:34:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:17,989 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-19 04:34:17,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:17,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 04:34:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:18,157 INFO L225 Difference]: With dead ends: 40220 [2019-12-19 04:34:18,157 INFO L226 Difference]: Without dead ends: 40060 [2019-12-19 04:34:18,158 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-19 04:34:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-19 04:34:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-19 04:34:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-19 04:34:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-19 04:34:20,845 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-19 04:34:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:20,846 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-19 04:34:20,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-19 04:34:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 04:34:20,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:20,857 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] [2019-12-19 04:34:20,858 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:20,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-19 04:34:20,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:20,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441943190] [2019-12-19 04:34:20,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:21,015 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-19 04:34:21,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441943190] [2019-12-19 04:34:21,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:21,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:21,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219687959] [2019-12-19 04:34:21,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:21,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:21,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:21,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:21,019 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 6 states. [2019-12-19 04:34:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:22,323 INFO L93 Difference]: Finished difference Result 45669 states and 166169 transitions. [2019-12-19 04:34:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:34:22,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 04:34:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:22,463 INFO L225 Difference]: With dead ends: 45669 [2019-12-19 04:34:22,464 INFO L226 Difference]: Without dead ends: 45525 [2019-12-19 04:34:22,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 04:34:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45525 states. [2019-12-19 04:34:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45525 to 33604. [2019-12-19 04:34:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33604 states. [2019-12-19 04:34:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33604 states to 33604 states and 125430 transitions. [2019-12-19 04:34:25,083 INFO L78 Accepts]: Start accepts. Automaton has 33604 states and 125430 transitions. Word has length 52 [2019-12-19 04:34:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:25,084 INFO L462 AbstractCegarLoop]: Abstraction has 33604 states and 125430 transitions. [2019-12-19 04:34:25,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 33604 states and 125430 transitions. [2019-12-19 04:34:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-19 04:34:25,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:25,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:25,118 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:25,118 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-19 04:34:25,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:25,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551052477] [2019-12-19 04:34:25,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:25,251 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-19 04:34:25,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551052477] [2019-12-19 04:34:25,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:25,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:25,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068787481] [2019-12-19 04:34:25,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:25,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:25,255 INFO L87 Difference]: Start difference. First operand 33604 states and 125430 transitions. Second operand 6 states. [2019-12-19 04:34:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:25,861 INFO L93 Difference]: Finished difference Result 46076 states and 167863 transitions. [2019-12-19 04:34:25,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:34:25,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-19 04:34:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:26,316 INFO L225 Difference]: With dead ends: 46076 [2019-12-19 04:34:26,316 INFO L226 Difference]: Without dead ends: 45836 [2019-12-19 04:34:26,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:34:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45836 states. [2019-12-19 04:34:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45836 to 39965. [2019-12-19 04:34:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39965 states. [2019-12-19 04:34:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39965 states to 39965 states and 147354 transitions. [2019-12-19 04:34:28,930 INFO L78 Accepts]: Start accepts. Automaton has 39965 states and 147354 transitions. Word has length 59 [2019-12-19 04:34:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:28,931 INFO L462 AbstractCegarLoop]: Abstraction has 39965 states and 147354 transitions. [2019-12-19 04:34:28,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 39965 states and 147354 transitions. [2019-12-19 04:34:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 04:34:28,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:28,965 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] [2019-12-19 04:34:28,966 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:28,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-19 04:34:28,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:28,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425048277] [2019-12-19 04:34:28,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:29,033 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-19 04:34:29,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425048277] [2019-12-19 04:34:29,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:29,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:34:29,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304041797] [2019-12-19 04:34:29,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:34:29,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:34:29,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:34:29,037 INFO L87 Difference]: Start difference. First operand 39965 states and 147354 transitions. Second operand 3 states. [2019-12-19 04:34:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:29,295 INFO L93 Difference]: Finished difference Result 50263 states and 182189 transitions. [2019-12-19 04:34:29,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:34:29,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-19 04:34:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:29,446 INFO L225 Difference]: With dead ends: 50263 [2019-12-19 04:34:29,446 INFO L226 Difference]: Without dead ends: 50263 [2019-12-19 04:34:29,446 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-19 04:34:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2019-12-19 04:34:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 43895. [2019-12-19 04:34:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43895 states. [2019-12-19 04:34:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43895 states to 43895 states and 160792 transitions. [2019-12-19 04:34:30,600 INFO L78 Accepts]: Start accepts. Automaton has 43895 states and 160792 transitions. Word has length 61 [2019-12-19 04:34:30,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:30,601 INFO L462 AbstractCegarLoop]: Abstraction has 43895 states and 160792 transitions. [2019-12-19 04:34:30,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:34:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 43895 states and 160792 transitions. [2019-12-19 04:34:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 04:34:30,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:30,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:30,638 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:30,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-19 04:34:30,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:30,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121730513] [2019-12-19 04:34:30,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:30,738 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-19 04:34:30,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121730513] [2019-12-19 04:34:30,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:30,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:30,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701929832] [2019-12-19 04:34:30,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:30,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:30,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:30,741 INFO L87 Difference]: Start difference. First operand 43895 states and 160792 transitions. Second operand 7 states. [2019-12-19 04:34:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:32,151 INFO L93 Difference]: Finished difference Result 55891 states and 200526 transitions. [2019-12-19 04:34:32,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:34:32,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 04:34:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:32,270 INFO L225 Difference]: With dead ends: 55891 [2019-12-19 04:34:32,271 INFO L226 Difference]: Without dead ends: 55651 [2019-12-19 04:34:32,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:34:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55651 states. [2019-12-19 04:34:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55651 to 45121. [2019-12-19 04:34:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45121 states. [2019-12-19 04:34:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45121 states to 45121 states and 164959 transitions. [2019-12-19 04:34:33,598 INFO L78 Accepts]: Start accepts. Automaton has 45121 states and 164959 transitions. Word has length 65 [2019-12-19 04:34:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:33,599 INFO L462 AbstractCegarLoop]: Abstraction has 45121 states and 164959 transitions. [2019-12-19 04:34:33,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 45121 states and 164959 transitions. [2019-12-19 04:34:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:34:33,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:33,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:33,635 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-19 04:34:33,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:33,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769509491] [2019-12-19 04:34:33,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:33,714 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-19 04:34:33,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769509491] [2019-12-19 04:34:33,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:33,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:33,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151064967] [2019-12-19 04:34:33,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:33,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:33,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:33,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:33,717 INFO L87 Difference]: Start difference. First operand 45121 states and 164959 transitions. Second operand 4 states. [2019-12-19 04:34:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:34,634 INFO L93 Difference]: Finished difference Result 69403 states and 252019 transitions. [2019-12-19 04:34:34,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:34,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 04:34:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:34,788 INFO L225 Difference]: With dead ends: 69403 [2019-12-19 04:34:34,788 INFO L226 Difference]: Without dead ends: 69403 [2019-12-19 04:34:34,788 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-19 04:34:35,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69403 states. [2019-12-19 04:34:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69403 to 53611. [2019-12-19 04:34:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53611 states. [2019-12-19 04:34:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53611 states to 53611 states and 195428 transitions. [2019-12-19 04:34:36,282 INFO L78 Accepts]: Start accepts. Automaton has 53611 states and 195428 transitions. Word has length 66 [2019-12-19 04:34:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:36,283 INFO L462 AbstractCegarLoop]: Abstraction has 53611 states and 195428 transitions. [2019-12-19 04:34:36,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 53611 states and 195428 transitions. [2019-12-19 04:34:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:34:36,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:36,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 04:34:36,322 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:36,323 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-19 04:34:36,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:36,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867993958] [2019-12-19 04:34:36,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:36,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867993958] [2019-12-19 04:34:36,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:36,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:36,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932499281] [2019-12-19 04:34:36,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:36,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:36,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:36,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:36,406 INFO L87 Difference]: Start difference. First operand 53611 states and 195428 transitions. Second operand 7 states. [2019-12-19 04:34:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:37,711 INFO L93 Difference]: Finished difference Result 63822 states and 228895 transitions. [2019-12-19 04:34:37,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:34:37,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 04:34:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:37,887 INFO L225 Difference]: With dead ends: 63822 [2019-12-19 04:34:37,887 INFO L226 Difference]: Without dead ends: 63622 [2019-12-19 04:34:37,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 04:34:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63622 states. [2019-12-19 04:34:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63622 to 54380. [2019-12-19 04:34:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54380 states. [2019-12-19 04:34:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54380 states to 54380 states and 197958 transitions. [2019-12-19 04:34:42,023 INFO L78 Accepts]: Start accepts. Automaton has 54380 states and 197958 transitions. Word has length 66 [2019-12-19 04:34:42,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:42,023 INFO L462 AbstractCegarLoop]: Abstraction has 54380 states and 197958 transitions. [2019-12-19 04:34:42,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 54380 states and 197958 transitions. [2019-12-19 04:34:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:34:42,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:42,080 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] [2019-12-19 04:34:42,080 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-19 04:34:42,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:42,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273573672] [2019-12-19 04:34:42,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:42,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273573672] [2019-12-19 04:34:42,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:42,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:42,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712412011] [2019-12-19 04:34:42,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:42,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:42,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:42,190 INFO L87 Difference]: Start difference. First operand 54380 states and 197958 transitions. Second operand 6 states. [2019-12-19 04:34:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:42,958 INFO L93 Difference]: Finished difference Result 75817 states and 274672 transitions. [2019-12-19 04:34:42,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:42,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 04:34:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:43,126 INFO L225 Difference]: With dead ends: 75817 [2019-12-19 04:34:43,126 INFO L226 Difference]: Without dead ends: 75173 [2019-12-19 04:34:43,126 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-19 04:34:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75173 states. [2019-12-19 04:34:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75173 to 65280. [2019-12-19 04:34:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65280 states. [2019-12-19 04:34:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65280 states to 65280 states and 238125 transitions. [2019-12-19 04:34:44,668 INFO L78 Accepts]: Start accepts. Automaton has 65280 states and 238125 transitions. Word has length 68 [2019-12-19 04:34:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:44,668 INFO L462 AbstractCegarLoop]: Abstraction has 65280 states and 238125 transitions. [2019-12-19 04:34:44,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 65280 states and 238125 transitions. [2019-12-19 04:34:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:34:44,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:44,741 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] [2019-12-19 04:34:44,741 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-19 04:34:44,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:44,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859910879] [2019-12-19 04:34:44,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:44,860 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-19 04:34:44,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859910879] [2019-12-19 04:34:44,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:44,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:44,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790664079] [2019-12-19 04:34:44,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:44,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:44,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:44,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:44,863 INFO L87 Difference]: Start difference. First operand 65280 states and 238125 transitions. Second operand 7 states. [2019-12-19 04:34:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:46,491 INFO L93 Difference]: Finished difference Result 92241 states and 326467 transitions. [2019-12-19 04:34:46,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:34:46,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 04:34:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:46,719 INFO L225 Difference]: With dead ends: 92241 [2019-12-19 04:34:46,719 INFO L226 Difference]: Without dead ends: 92241 [2019-12-19 04:34:46,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:34:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92241 states. [2019-12-19 04:34:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92241 to 84350. [2019-12-19 04:34:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84350 states. [2019-12-19 04:34:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84350 states to 84350 states and 301234 transitions. [2019-12-19 04:34:50,816 INFO L78 Accepts]: Start accepts. Automaton has 84350 states and 301234 transitions. Word has length 68 [2019-12-19 04:34:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:50,816 INFO L462 AbstractCegarLoop]: Abstraction has 84350 states and 301234 transitions. [2019-12-19 04:34:50,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 84350 states and 301234 transitions. [2019-12-19 04:34:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:34:50,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:50,896 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] [2019-12-19 04:34:50,896 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:50,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:50,897 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-19 04:34:50,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:50,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222139965] [2019-12-19 04:34:50,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:50,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222139965] [2019-12-19 04:34:50,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:50,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:50,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896834563] [2019-12-19 04:34:50,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:50,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:50,969 INFO L87 Difference]: Start difference. First operand 84350 states and 301234 transitions. Second operand 4 states. [2019-12-19 04:34:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:51,085 INFO L93 Difference]: Finished difference Result 19361 states and 61140 transitions. [2019-12-19 04:34:51,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:51,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 04:34:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:51,115 INFO L225 Difference]: With dead ends: 19361 [2019-12-19 04:34:51,115 INFO L226 Difference]: Without dead ends: 18883 [2019-12-19 04:34:51,115 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-19 04:34:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18883 states. [2019-12-19 04:34:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18883 to 18871. [2019-12-19 04:34:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18871 states. [2019-12-19 04:34:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18871 states to 18871 states and 59635 transitions. [2019-12-19 04:34:51,367 INFO L78 Accepts]: Start accepts. Automaton has 18871 states and 59635 transitions. Word has length 68 [2019-12-19 04:34:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:51,367 INFO L462 AbstractCegarLoop]: Abstraction has 18871 states and 59635 transitions. [2019-12-19 04:34:51,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 18871 states and 59635 transitions. [2019-12-19 04:34:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:34:51,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:51,381 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] [2019-12-19 04:34:51,382 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1837430218, now seen corresponding path program 1 times [2019-12-19 04:34:51,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:51,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553213083] [2019-12-19 04:34:51,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:52,005 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-19 04:34:52,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553213083] [2019-12-19 04:34:52,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:52,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:52,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157474040] [2019-12-19 04:34:52,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:52,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:52,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:52,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:52,007 INFO L87 Difference]: Start difference. First operand 18871 states and 59635 transitions. Second operand 4 states. [2019-12-19 04:34:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:52,291 INFO L93 Difference]: Finished difference Result 24271 states and 75815 transitions. [2019-12-19 04:34:52,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:52,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-19 04:34:52,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:52,344 INFO L225 Difference]: With dead ends: 24271 [2019-12-19 04:34:52,345 INFO L226 Difference]: Without dead ends: 24271 [2019-12-19 04:34:52,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24271 states. [2019-12-19 04:34:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24271 to 19783. [2019-12-19 04:34:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19783 states. [2019-12-19 04:34:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19783 states to 19783 states and 62293 transitions. [2019-12-19 04:34:52,666 INFO L78 Accepts]: Start accepts. Automaton has 19783 states and 62293 transitions. Word has length 78 [2019-12-19 04:34:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:52,666 INFO L462 AbstractCegarLoop]: Abstraction has 19783 states and 62293 transitions. [2019-12-19 04:34:52,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 19783 states and 62293 transitions. [2019-12-19 04:34:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:34:52,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:52,688 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] [2019-12-19 04:34:52,688 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1582693673, now seen corresponding path program 1 times [2019-12-19 04:34:52,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:52,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887903739] [2019-12-19 04:34:52,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:52,772 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-19 04:34:52,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887903739] [2019-12-19 04:34:52,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:52,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:34:52,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896049437] [2019-12-19 04:34:52,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:34:52,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:34:52,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:52,775 INFO L87 Difference]: Start difference. First operand 19783 states and 62293 transitions. Second operand 8 states. [2019-12-19 04:34:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:53,934 INFO L93 Difference]: Finished difference Result 21937 states and 68541 transitions. [2019-12-19 04:34:53,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 04:34:53,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-19 04:34:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:53,971 INFO L225 Difference]: With dead ends: 21937 [2019-12-19 04:34:53,971 INFO L226 Difference]: Without dead ends: 21889 [2019-12-19 04:34:53,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-19 04:34:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21889 states. [2019-12-19 04:34:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21889 to 17452. [2019-12-19 04:34:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17452 states. [2019-12-19 04:34:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17452 states to 17452 states and 55312 transitions. [2019-12-19 04:34:54,238 INFO L78 Accepts]: Start accepts. Automaton has 17452 states and 55312 transitions. Word has length 78 [2019-12-19 04:34:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:54,238 INFO L462 AbstractCegarLoop]: Abstraction has 17452 states and 55312 transitions. [2019-12-19 04:34:54,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:34:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 17452 states and 55312 transitions. [2019-12-19 04:34:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 04:34:54,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:54,255 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] [2019-12-19 04:34:54,256 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:54,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:54,256 INFO L82 PathProgramCache]: Analyzing trace with hash -286863040, now seen corresponding path program 1 times [2019-12-19 04:34:54,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:54,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344226184] [2019-12-19 04:34:54,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:54,296 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-19 04:34:54,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344226184] [2019-12-19 04:34:54,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:54,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:34:54,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070551812] [2019-12-19 04:34:54,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:34:54,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:34:54,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:34:54,298 INFO L87 Difference]: Start difference. First operand 17452 states and 55312 transitions. Second operand 3 states. [2019-12-19 04:34:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:54,528 INFO L93 Difference]: Finished difference Result 18716 states and 59025 transitions. [2019-12-19 04:34:54,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:34:54,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-19 04:34:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:54,560 INFO L225 Difference]: With dead ends: 18716 [2019-12-19 04:34:54,560 INFO L226 Difference]: Without dead ends: 18716 [2019-12-19 04:34:54,561 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-19 04:34:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18716 states. [2019-12-19 04:34:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18716 to 18068. [2019-12-19 04:34:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18068 states. [2019-12-19 04:34:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18068 states to 18068 states and 57126 transitions. [2019-12-19 04:34:55,746 INFO L78 Accepts]: Start accepts. Automaton has 18068 states and 57126 transitions. Word has length 79 [2019-12-19 04:34:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:55,746 INFO L462 AbstractCegarLoop]: Abstraction has 18068 states and 57126 transitions. [2019-12-19 04:34:55,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:34:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 18068 states and 57126 transitions. [2019-12-19 04:34:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 04:34:55,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:55,763 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] [2019-12-19 04:34:55,764 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:55,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1882330754, now seen corresponding path program 1 times [2019-12-19 04:34:55,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:55,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077364494] [2019-12-19 04:34:55,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:55,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077364494] [2019-12-19 04:34:55,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:55,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:55,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844835819] [2019-12-19 04:34:55,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:55,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:55,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:55,837 INFO L87 Difference]: Start difference. First operand 18068 states and 57126 transitions. Second operand 4 states. [2019-12-19 04:34:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:56,139 INFO L93 Difference]: Finished difference Result 21236 states and 66256 transitions. [2019-12-19 04:34:56,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:34:56,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 04:34:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:56,170 INFO L225 Difference]: With dead ends: 21236 [2019-12-19 04:34:56,170 INFO L226 Difference]: Without dead ends: 21236 [2019-12-19 04:34:56,171 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-19 04:34:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2019-12-19 04:34:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 20213. [2019-12-19 04:34:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20213 states. [2019-12-19 04:34:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20213 states to 20213 states and 63372 transitions. [2019-12-19 04:34:56,449 INFO L78 Accepts]: Start accepts. Automaton has 20213 states and 63372 transitions. Word has length 80 [2019-12-19 04:34:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:56,449 INFO L462 AbstractCegarLoop]: Abstraction has 20213 states and 63372 transitions. [2019-12-19 04:34:56,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 20213 states and 63372 transitions. [2019-12-19 04:34:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 04:34:56,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:56,468 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] [2019-12-19 04:34:56,469 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:56,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash 476976255, now seen corresponding path program 1 times [2019-12-19 04:34:56,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:56,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871515454] [2019-12-19 04:34:56,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:56,512 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-19 04:34:56,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871515454] [2019-12-19 04:34:56,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:56,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:34:56,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288022311] [2019-12-19 04:34:56,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:34:56,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:56,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:34:56,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:34:56,514 INFO L87 Difference]: Start difference. First operand 20213 states and 63372 transitions. Second operand 3 states. [2019-12-19 04:34:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:56,844 INFO L93 Difference]: Finished difference Result 21556 states and 67295 transitions. [2019-12-19 04:34:56,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:34:56,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-19 04:34:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:56,893 INFO L225 Difference]: With dead ends: 21556 [2019-12-19 04:34:56,894 INFO L226 Difference]: Without dead ends: 21556 [2019-12-19 04:34:56,894 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-19 04:34:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21556 states. [2019-12-19 04:34:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21556 to 20893. [2019-12-19 04:34:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20893 states. [2019-12-19 04:34:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20893 states to 20893 states and 65352 transitions. [2019-12-19 04:34:57,234 INFO L78 Accepts]: Start accepts. Automaton has 20893 states and 65352 transitions. Word has length 80 [2019-12-19 04:34:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:57,234 INFO L462 AbstractCegarLoop]: Abstraction has 20893 states and 65352 transitions. [2019-12-19 04:34:57,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:34:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20893 states and 65352 transitions. [2019-12-19 04:34:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:57,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:57,254 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] [2019-12-19 04:34:57,254 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:57,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash 286965984, now seen corresponding path program 1 times [2019-12-19 04:34:57,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:57,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050626476] [2019-12-19 04:34:57,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:57,341 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-19 04:34:57,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050626476] [2019-12-19 04:34:57,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:57,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:57,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230183129] [2019-12-19 04:34:57,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:57,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:57,343 INFO L87 Difference]: Start difference. First operand 20893 states and 65352 transitions. Second operand 6 states. [2019-12-19 04:34:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:58,333 INFO L93 Difference]: Finished difference Result 29926 states and 92023 transitions. [2019-12-19 04:34:58,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:34:58,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:34:58,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:58,372 INFO L225 Difference]: With dead ends: 29926 [2019-12-19 04:34:58,372 INFO L226 Difference]: Without dead ends: 29620 [2019-12-19 04:34:58,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:34:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29620 states. [2019-12-19 04:34:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29620 to 23908. [2019-12-19 04:34:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23908 states. [2019-12-19 04:34:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23908 states to 23908 states and 74649 transitions. [2019-12-19 04:34:58,714 INFO L78 Accepts]: Start accepts. Automaton has 23908 states and 74649 transitions. Word has length 81 [2019-12-19 04:34:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:58,715 INFO L462 AbstractCegarLoop]: Abstraction has 23908 states and 74649 transitions. [2019-12-19 04:34:58,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 23908 states and 74649 transitions. [2019-12-19 04:34:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:58,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:58,737 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] [2019-12-19 04:34:58,737 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1248580001, now seen corresponding path program 1 times [2019-12-19 04:34:58,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:58,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533576996] [2019-12-19 04:34:58,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:58,823 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-19 04:34:58,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533576996] [2019-12-19 04:34:58,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:58,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:58,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537422596] [2019-12-19 04:34:58,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:58,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:58,825 INFO L87 Difference]: Start difference. First operand 23908 states and 74649 transitions. Second operand 7 states. [2019-12-19 04:35:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:00,322 INFO L93 Difference]: Finished difference Result 41338 states and 124799 transitions. [2019-12-19 04:35:00,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 04:35:00,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-19 04:35:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:00,431 INFO L225 Difference]: With dead ends: 41338 [2019-12-19 04:35:00,432 INFO L226 Difference]: Without dead ends: 41266 [2019-12-19 04:35:00,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-19 04:35:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41266 states. [2019-12-19 04:35:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41266 to 25666. [2019-12-19 04:35:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25666 states. [2019-12-19 04:35:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25666 states to 25666 states and 78735 transitions. [2019-12-19 04:35:01,197 INFO L78 Accepts]: Start accepts. Automaton has 25666 states and 78735 transitions. Word has length 81 [2019-12-19 04:35:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:01,197 INFO L462 AbstractCegarLoop]: Abstraction has 25666 states and 78735 transitions. [2019-12-19 04:35:01,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:35:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 25666 states and 78735 transitions. [2019-12-19 04:35:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:35:01,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:01,218 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] [2019-12-19 04:35:01,218 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1471857053, now seen corresponding path program 1 times [2019-12-19 04:35:01,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:01,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026104266] [2019-12-19 04:35:01,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:01,295 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-19 04:35:01,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026104266] [2019-12-19 04:35:01,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:01,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:35:01,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696373768] [2019-12-19 04:35:01,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:35:01,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:35:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:01,297 INFO L87 Difference]: Start difference. First operand 25666 states and 78735 transitions. Second operand 6 states. [2019-12-19 04:35:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:01,755 INFO L93 Difference]: Finished difference Result 39156 states and 120109 transitions. [2019-12-19 04:35:01,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:35:01,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:35:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:01,824 INFO L225 Difference]: With dead ends: 39156 [2019-12-19 04:35:01,824 INFO L226 Difference]: Without dead ends: 39156 [2019-12-19 04:35:01,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:35:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39156 states. [2019-12-19 04:35:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39156 to 25377. [2019-12-19 04:35:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25377 states. [2019-12-19 04:35:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25377 states to 25377 states and 77387 transitions. [2019-12-19 04:35:02,474 INFO L78 Accepts]: Start accepts. Automaton has 25377 states and 77387 transitions. Word has length 81 [2019-12-19 04:35:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:02,474 INFO L462 AbstractCegarLoop]: Abstraction has 25377 states and 77387 transitions. [2019-12-19 04:35:02,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:35:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 25377 states and 77387 transitions. [2019-12-19 04:35:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:35:02,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:02,497 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] [2019-12-19 04:35:02,497 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash -991140637, now seen corresponding path program 1 times [2019-12-19 04:35:02,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:02,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157781083] [2019-12-19 04:35:02,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:02,594 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-19 04:35:02,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157781083] [2019-12-19 04:35:02,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:02,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:35:02,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412629038] [2019-12-19 04:35:02,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:35:02,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:02,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:35:02,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:35:02,596 INFO L87 Difference]: Start difference. First operand 25377 states and 77387 transitions. Second operand 7 states. [2019-12-19 04:35:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:03,476 INFO L93 Difference]: Finished difference Result 31557 states and 94596 transitions. [2019-12-19 04:35:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:35:03,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-19 04:35:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:03,520 INFO L225 Difference]: With dead ends: 31557 [2019-12-19 04:35:03,520 INFO L226 Difference]: Without dead ends: 31557 [2019-12-19 04:35:03,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:35:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31557 states. [2019-12-19 04:35:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31557 to 27312. [2019-12-19 04:35:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27312 states. [2019-12-19 04:35:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27312 states to 27312 states and 83150 transitions. [2019-12-19 04:35:03,909 INFO L78 Accepts]: Start accepts. Automaton has 27312 states and 83150 transitions. Word has length 81 [2019-12-19 04:35:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:03,910 INFO L462 AbstractCegarLoop]: Abstraction has 27312 states and 83150 transitions. [2019-12-19 04:35:03,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:35:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 27312 states and 83150 transitions. [2019-12-19 04:35:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:35:03,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:03,933 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] [2019-12-19 04:35:03,934 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash 253623844, now seen corresponding path program 1 times [2019-12-19 04:35:03,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:03,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84811223] [2019-12-19 04:35:03,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:04,026 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-19 04:35:04,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84811223] [2019-12-19 04:35:04,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:04,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:35:04,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838665081] [2019-12-19 04:35:04,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:35:04,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:04,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:35:04,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:04,029 INFO L87 Difference]: Start difference. First operand 27312 states and 83150 transitions. Second operand 6 states. [2019-12-19 04:35:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:04,379 INFO L93 Difference]: Finished difference Result 27250 states and 82976 transitions. [2019-12-19 04:35:04,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:35:04,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:35:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:04,451 INFO L225 Difference]: With dead ends: 27250 [2019-12-19 04:35:04,452 INFO L226 Difference]: Without dead ends: 27250 [2019-12-19 04:35:04,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27250 states. [2019-12-19 04:35:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27250 to 27250. [2019-12-19 04:35:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27250 states. [2019-12-19 04:35:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27250 states to 27250 states and 82976 transitions. [2019-12-19 04:35:05,426 INFO L78 Accepts]: Start accepts. Automaton has 27250 states and 82976 transitions. Word has length 81 [2019-12-19 04:35:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:05,427 INFO L462 AbstractCegarLoop]: Abstraction has 27250 states and 82976 transitions. [2019-12-19 04:35:05,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:35:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 27250 states and 82976 transitions. [2019-12-19 04:35:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:35:05,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:05,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:35:05,458 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash -305951838, now seen corresponding path program 1 times [2019-12-19 04:35:05,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:05,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180819720] [2019-12-19 04:35:05,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:05,555 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-19 04:35:05,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180819720] [2019-12-19 04:35:05,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:05,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:35:05,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856018042] [2019-12-19 04:35:05,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:35:05,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:35:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:05,560 INFO L87 Difference]: Start difference. First operand 27250 states and 82976 transitions. Second operand 6 states. [2019-12-19 04:35:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:06,430 INFO L93 Difference]: Finished difference Result 40321 states and 121816 transitions. [2019-12-19 04:35:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:35:06,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:35:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:06,492 INFO L225 Difference]: With dead ends: 40321 [2019-12-19 04:35:06,492 INFO L226 Difference]: Without dead ends: 40321 [2019-12-19 04:35:06,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:35:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40321 states. [2019-12-19 04:35:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40321 to 28828. [2019-12-19 04:35:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28828 states. [2019-12-19 04:35:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28828 states to 28828 states and 87715 transitions. [2019-12-19 04:35:06,946 INFO L78 Accepts]: Start accepts. Automaton has 28828 states and 87715 transitions. Word has length 81 [2019-12-19 04:35:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:06,946 INFO L462 AbstractCegarLoop]: Abstraction has 28828 states and 87715 transitions. [2019-12-19 04:35:06,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:35:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28828 states and 87715 transitions. [2019-12-19 04:35:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:35:06,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:06,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] [2019-12-19 04:35:06,972 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:06,972 INFO L82 PathProgramCache]: Analyzing trace with hash 938812643, now seen corresponding path program 1 times [2019-12-19 04:35:06,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:06,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970420233] [2019-12-19 04:35:06,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:07,079 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-19 04:35:07,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970420233] [2019-12-19 04:35:07,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:07,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:35:07,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672896022] [2019-12-19 04:35:07,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:35:07,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:35:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:35:07,081 INFO L87 Difference]: Start difference. First operand 28828 states and 87715 transitions. Second operand 5 states. [2019-12-19 04:35:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:07,328 INFO L93 Difference]: Finished difference Result 28747 states and 87427 transitions. [2019-12-19 04:35:07,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:35:07,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-19 04:35:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:07,370 INFO L225 Difference]: With dead ends: 28747 [2019-12-19 04:35:07,370 INFO L226 Difference]: Without dead ends: 28747 [2019-12-19 04:35:07,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:35:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28747 states. [2019-12-19 04:35:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28747 to 28702. [2019-12-19 04:35:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28702 states. [2019-12-19 04:35:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28702 states to 28702 states and 87307 transitions. [2019-12-19 04:35:07,748 INFO L78 Accepts]: Start accepts. Automaton has 28702 states and 87307 transitions. Word has length 81 [2019-12-19 04:35:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:07,749 INFO L462 AbstractCegarLoop]: Abstraction has 28702 states and 87307 transitions. [2019-12-19 04:35:07,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:35:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 28702 states and 87307 transitions. [2019-12-19 04:35:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:35:07,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:07,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:35:07,773 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:07,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1900426660, now seen corresponding path program 1 times [2019-12-19 04:35:07,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:07,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997716543] [2019-12-19 04:35:07,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:07,860 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-19 04:35:07,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997716543] [2019-12-19 04:35:07,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:07,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:35:07,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485407227] [2019-12-19 04:35:07,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:35:07,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:07,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:35:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:35:07,862 INFO L87 Difference]: Start difference. First operand 28702 states and 87307 transitions. Second operand 5 states. [2019-12-19 04:35:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:08,243 INFO L93 Difference]: Finished difference Result 40057 states and 121690 transitions. [2019-12-19 04:35:08,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:35:08,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-19 04:35:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:08,296 INFO L225 Difference]: With dead ends: 40057 [2019-12-19 04:35:08,296 INFO L226 Difference]: Without dead ends: 40057 [2019-12-19 04:35:08,297 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-19 04:35:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40057 states. [2019-12-19 04:35:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40057 to 25282. [2019-12-19 04:35:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25282 states. [2019-12-19 04:35:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25282 states to 25282 states and 75960 transitions. [2019-12-19 04:35:08,689 INFO L78 Accepts]: Start accepts. Automaton has 25282 states and 75960 transitions. Word has length 81 [2019-12-19 04:35:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:08,689 INFO L462 AbstractCegarLoop]: Abstraction has 25282 states and 75960 transitions. [2019-12-19 04:35:08,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:35:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 25282 states and 75960 transitions. [2019-12-19 04:35:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:35:08,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:08,710 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] [2019-12-19 04:35:08,710 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1913824220, now seen corresponding path program 1 times [2019-12-19 04:35:08,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:08,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033181018] [2019-12-19 04:35:08,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:08,792 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-19 04:35:08,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033181018] [2019-12-19 04:35:08,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:08,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:35:08,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496057816] [2019-12-19 04:35:08,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:35:08,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:35:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:35:08,794 INFO L87 Difference]: Start difference. First operand 25282 states and 75960 transitions. Second operand 5 states. [2019-12-19 04:35:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:08,842 INFO L93 Difference]: Finished difference Result 3064 states and 7430 transitions. [2019-12-19 04:35:08,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:35:08,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-19 04:35:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:08,847 INFO L225 Difference]: With dead ends: 3064 [2019-12-19 04:35:08,847 INFO L226 Difference]: Without dead ends: 2668 [2019-12-19 04:35:08,847 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-19 04:35:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-12-19 04:35:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2424. [2019-12-19 04:35:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2019-12-19 04:35:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 5875 transitions. [2019-12-19 04:35:08,886 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 5875 transitions. Word has length 81 [2019-12-19 04:35:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:08,886 INFO L462 AbstractCegarLoop]: Abstraction has 2424 states and 5875 transitions. [2019-12-19 04:35:08,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:35:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 5875 transitions. [2019-12-19 04:35:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:35:08,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:08,890 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] [2019-12-19 04:35:08,890 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1212257335, now seen corresponding path program 1 times [2019-12-19 04:35:08,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:08,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278434700] [2019-12-19 04:35:08,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:09,008 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-19 04:35:09,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278434700] [2019-12-19 04:35:09,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:09,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:35:09,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497294243] [2019-12-19 04:35:09,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:35:09,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:09,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:35:09,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:09,010 INFO L87 Difference]: Start difference. First operand 2424 states and 5875 transitions. Second operand 6 states. [2019-12-19 04:35:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:09,097 INFO L93 Difference]: Finished difference Result 2655 states and 6264 transitions. [2019-12-19 04:35:09,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:35:09,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:35:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:09,100 INFO L225 Difference]: With dead ends: 2655 [2019-12-19 04:35:09,100 INFO L226 Difference]: Without dead ends: 2610 [2019-12-19 04:35:09,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:35:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-12-19 04:35:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2463. [2019-12-19 04:35:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-19 04:35:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5897 transitions. [2019-12-19 04:35:09,123 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5897 transitions. Word has length 93 [2019-12-19 04:35:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:09,124 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5897 transitions. [2019-12-19 04:35:09,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:35:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5897 transitions. [2019-12-19 04:35:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:35:09,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:09,126 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] [2019-12-19 04:35:09,126 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash -419839496, now seen corresponding path program 1 times [2019-12-19 04:35:09,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:09,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103456932] [2019-12-19 04:35:09,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:09,192 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-19 04:35:09,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103456932] [2019-12-19 04:35:09,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:09,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:35:09,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594503063] [2019-12-19 04:35:09,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:35:09,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:35:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:35:09,194 INFO L87 Difference]: Start difference. First operand 2463 states and 5897 transitions. Second operand 5 states. [2019-12-19 04:35:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:09,406 INFO L93 Difference]: Finished difference Result 2771 states and 6550 transitions. [2019-12-19 04:35:09,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:35:09,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 04:35:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:09,410 INFO L225 Difference]: With dead ends: 2771 [2019-12-19 04:35:09,411 INFO L226 Difference]: Without dead ends: 2753 [2019-12-19 04:35:09,411 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-19 04:35:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2019-12-19 04:35:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2534. [2019-12-19 04:35:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-19 04:35:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 6039 transitions. [2019-12-19 04:35:09,446 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 6039 transitions. Word has length 93 [2019-12-19 04:35:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:09,447 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 6039 transitions. [2019-12-19 04:35:09,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:35:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 6039 transitions. [2019-12-19 04:35:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:35:09,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:09,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 04:35:09,450 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2092638256, now seen corresponding path program 2 times [2019-12-19 04:35:09,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:09,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697008376] [2019-12-19 04:35:09,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:09,553 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-19 04:35:09,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697008376] [2019-12-19 04:35:09,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:09,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:35:09,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321058457] [2019-12-19 04:35:09,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:35:09,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:35:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:09,555 INFO L87 Difference]: Start difference. First operand 2534 states and 6039 transitions. Second operand 6 states. [2019-12-19 04:35:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:09,897 INFO L93 Difference]: Finished difference Result 3366 states and 7918 transitions. [2019-12-19 04:35:09,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:35:09,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:35:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:09,904 INFO L225 Difference]: With dead ends: 3366 [2019-12-19 04:35:09,905 INFO L226 Difference]: Without dead ends: 3330 [2019-12-19 04:35:09,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:35:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2019-12-19 04:35:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2810. [2019-12-19 04:35:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-19 04:35:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6664 transitions. [2019-12-19 04:35:09,973 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6664 transitions. Word has length 93 [2019-12-19 04:35:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:09,973 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6664 transitions. [2019-12-19 04:35:09,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:35:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6664 transitions. [2019-12-19 04:35:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:35:09,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:09,979 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] [2019-12-19 04:35:09,979 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:09,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1809487792, now seen corresponding path program 1 times [2019-12-19 04:35:09,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:09,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889948738] [2019-12-19 04:35:09,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:10,128 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-19 04:35:10,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889948738] [2019-12-19 04:35:10,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:10,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:35:10,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747412828] [2019-12-19 04:35:10,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:35:10,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:35:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:35:10,132 INFO L87 Difference]: Start difference. First operand 2810 states and 6664 transitions. Second operand 7 states. [2019-12-19 04:35:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:10,542 INFO L93 Difference]: Finished difference Result 5429 states and 13161 transitions. [2019-12-19 04:35:10,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:35:10,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-19 04:35:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:10,550 INFO L225 Difference]: With dead ends: 5429 [2019-12-19 04:35:10,550 INFO L226 Difference]: Without dead ends: 5429 [2019-12-19 04:35:10,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:35:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5429 states. [2019-12-19 04:35:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5429 to 2937. [2019-12-19 04:35:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2019-12-19 04:35:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 6972 transitions. [2019-12-19 04:35:10,616 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 6972 transitions. Word has length 93 [2019-12-19 04:35:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:10,616 INFO L462 AbstractCegarLoop]: Abstraction has 2937 states and 6972 transitions. [2019-12-19 04:35:10,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:35:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 6972 transitions. [2019-12-19 04:35:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:35:10,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:10,620 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] [2019-12-19 04:35:10,620 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1240715023, now seen corresponding path program 1 times [2019-12-19 04:35:10,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:10,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379831743] [2019-12-19 04:35:10,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:10,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-19 04:35:10,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379831743] [2019-12-19 04:35:10,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:10,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:35:10,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773134842] [2019-12-19 04:35:10,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:35:10,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:10,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:35:10,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:10,733 INFO L87 Difference]: Start difference. First operand 2937 states and 6972 transitions. Second operand 6 states. [2019-12-19 04:35:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:10,791 INFO L93 Difference]: Finished difference Result 4592 states and 11122 transitions. [2019-12-19 04:35:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:35:10,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:35:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:10,796 INFO L225 Difference]: With dead ends: 4592 [2019-12-19 04:35:10,797 INFO L226 Difference]: Without dead ends: 4592 [2019-12-19 04:35:10,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2019-12-19 04:35:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 2900. [2019-12-19 04:35:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-12-19 04:35:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 6836 transitions. [2019-12-19 04:35:10,830 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 6836 transitions. Word has length 93 [2019-12-19 04:35:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:10,830 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 6836 transitions. [2019-12-19 04:35:10,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:35:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 6836 transitions. [2019-12-19 04:35:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:35:10,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:10,833 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] [2019-12-19 04:35:10,833 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash -759998607, now seen corresponding path program 1 times [2019-12-19 04:35:10,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:10,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131346337] [2019-12-19 04:35:10,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:10,946 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-19 04:35:10,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131346337] [2019-12-19 04:35:10,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:10,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:35:10,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014966135] [2019-12-19 04:35:10,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:35:10,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:35:10,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:10,948 INFO L87 Difference]: Start difference. First operand 2900 states and 6836 transitions. Second operand 6 states. [2019-12-19 04:35:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:11,151 INFO L93 Difference]: Finished difference Result 2729 states and 6293 transitions. [2019-12-19 04:35:11,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:35:11,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:35:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:11,156 INFO L225 Difference]: With dead ends: 2729 [2019-12-19 04:35:11,156 INFO L226 Difference]: Without dead ends: 2729 [2019-12-19 04:35:11,158 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-19 04:35:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2019-12-19 04:35:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 1987. [2019-12-19 04:35:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-12-19 04:35:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 4681 transitions. [2019-12-19 04:35:11,197 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 4681 transitions. Word has length 93 [2019-12-19 04:35:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:11,197 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 4681 transitions. [2019-12-19 04:35:11,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:35:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 4681 transitions. [2019-12-19 04:35:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:35:11,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:11,201 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] [2019-12-19 04:35:11,201 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:11,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:11,202 INFO L82 PathProgramCache]: Analyzing trace with hash 469539040, now seen corresponding path program 1 times [2019-12-19 04:35:11,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:11,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210414727] [2019-12-19 04:35:11,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:11,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-19 04:35:11,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210414727] [2019-12-19 04:35:11,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:11,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:35:11,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916767645] [2019-12-19 04:35:11,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:35:11,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:11,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:35:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:11,338 INFO L87 Difference]: Start difference. First operand 1987 states and 4681 transitions. Second operand 6 states. [2019-12-19 04:35:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:11,541 INFO L93 Difference]: Finished difference Result 2215 states and 5077 transitions. [2019-12-19 04:35:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:35:11,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:35:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:11,545 INFO L225 Difference]: With dead ends: 2215 [2019-12-19 04:35:11,546 INFO L226 Difference]: Without dead ends: 2215 [2019-12-19 04:35:11,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:35:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-12-19 04:35:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2019. [2019-12-19 04:35:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-19 04:35:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4705 transitions. [2019-12-19 04:35:11,576 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4705 transitions. Word has length 95 [2019-12-19 04:35:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:11,577 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4705 transitions. [2019-12-19 04:35:11,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:35:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4705 transitions. [2019-12-19 04:35:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:35:11,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:11,580 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] [2019-12-19 04:35:11,580 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:11,580 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-19 04:35:11,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:11,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931130478] [2019-12-19 04:35:11,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:11,689 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-19 04:35:11,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931130478] [2019-12-19 04:35:11,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:11,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:35:11,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142585526] [2019-12-19 04:35:11,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:35:11,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:11,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:35:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:35:11,692 INFO L87 Difference]: Start difference. First operand 2019 states and 4705 transitions. Second operand 5 states. [2019-12-19 04:35:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:11,921 INFO L93 Difference]: Finished difference Result 2271 states and 5284 transitions. [2019-12-19 04:35:11,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:35:11,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 04:35:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:11,924 INFO L225 Difference]: With dead ends: 2271 [2019-12-19 04:35:11,924 INFO L226 Difference]: Without dead ends: 2253 [2019-12-19 04:35:11,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:35:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-12-19 04:35:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2046. [2019-12-19 04:35:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-12-19 04:35:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 4759 transitions. [2019-12-19 04:35:11,956 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 4759 transitions. Word has length 95 [2019-12-19 04:35:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:11,956 INFO L462 AbstractCegarLoop]: Abstraction has 2046 states and 4759 transitions. [2019-12-19 04:35:11,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:35:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 4759 transitions. [2019-12-19 04:35:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:35:11,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:11,959 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] [2019-12-19 04:35:11,959 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:11,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-19 04:35:11,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:11,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723184068] [2019-12-19 04:35:11,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:12,026 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-19 04:35:12,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723184068] [2019-12-19 04:35:12,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:12,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:35:12,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485473334] [2019-12-19 04:35:12,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:35:12,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:12,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:35:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:35:12,032 INFO L87 Difference]: Start difference. First operand 2046 states and 4759 transitions. Second operand 6 states. [2019-12-19 04:35:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:12,126 INFO L93 Difference]: Finished difference Result 2123 states and 4906 transitions. [2019-12-19 04:35:12,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:35:12,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:35:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:12,128 INFO L225 Difference]: With dead ends: 2123 [2019-12-19 04:35:12,128 INFO L226 Difference]: Without dead ends: 2123 [2019-12-19 04:35:12,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:35:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-12-19 04:35:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2020. [2019-12-19 04:35:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-12-19 04:35:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4707 transitions. [2019-12-19 04:35:12,147 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4707 transitions. Word has length 95 [2019-12-19 04:35:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:12,149 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 4707 transitions. [2019-12-19 04:35:12,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:35:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4707 transitions. [2019-12-19 04:35:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:35:12,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:12,152 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] [2019-12-19 04:35:12,152 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:12,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-19 04:35:12,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:12,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652402334] [2019-12-19 04:35:12,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:12,283 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-19 04:35:12,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652402334] [2019-12-19 04:35:12,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:12,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:35:12,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440287712] [2019-12-19 04:35:12,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:35:12,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:12,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:35:12,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:35:12,285 INFO L87 Difference]: Start difference. First operand 2020 states and 4707 transitions. Second operand 8 states. [2019-12-19 04:35:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:12,500 INFO L93 Difference]: Finished difference Result 3367 states and 7933 transitions. [2019-12-19 04:35:12,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:35:12,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-19 04:35:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:12,503 INFO L225 Difference]: With dead ends: 3367 [2019-12-19 04:35:12,503 INFO L226 Difference]: Without dead ends: 1535 [2019-12-19 04:35:12,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:35:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2019-12-19 04:35:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1455. [2019-12-19 04:35:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-12-19 04:35:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 3420 transitions. [2019-12-19 04:35:12,533 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 3420 transitions. Word has length 95 [2019-12-19 04:35:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:12,534 INFO L462 AbstractCegarLoop]: Abstraction has 1455 states and 3420 transitions. [2019-12-19 04:35:12,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:35:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 3420 transitions. [2019-12-19 04:35:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:35:12,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:12,537 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] [2019-12-19 04:35:12,538 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:12,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:12,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-19 04:35:12,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:12,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000945566] [2019-12-19 04:35:12,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:35:12,732 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-19 04:35:12,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000945566] [2019-12-19 04:35:12,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:35:12,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:35:12,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219693797] [2019-12-19 04:35:12,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:35:12,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:35:12,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:35:12,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:35:12,736 INFO L87 Difference]: Start difference. First operand 1455 states and 3420 transitions. Second operand 11 states. [2019-12-19 04:35:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:35:12,976 INFO L93 Difference]: Finished difference Result 2624 states and 6270 transitions. [2019-12-19 04:35:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:35:12,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-19 04:35:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:35:12,981 INFO L225 Difference]: With dead ends: 2624 [2019-12-19 04:35:12,981 INFO L226 Difference]: Without dead ends: 1985 [2019-12-19 04:35:12,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:35:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-12-19 04:35:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1873. [2019-12-19 04:35:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-12-19 04:35:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 4324 transitions. [2019-12-19 04:35:13,019 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 4324 transitions. Word has length 95 [2019-12-19 04:35:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:35:13,020 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 4324 transitions. [2019-12-19 04:35:13,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:35:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 4324 transitions. [2019-12-19 04:35:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:35:13,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:35:13,023 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] [2019-12-19 04:35:13,023 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:35:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:35:13,024 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-19 04:35:13,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:35:13,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009397787] [2019-12-19 04:35:13,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:35:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:35:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:35:13,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:35:13,205 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:35:13,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:35:13 BasicIcfg [2019-12-19 04:35:13,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:35:13,403 INFO L168 Benchmark]: Toolchain (without parser) took 66718.93 ms. Allocated memory was 146.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 344.1 MB. Max. memory is 7.1 GB. [2019-12-19 04:35:13,404 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 04:35:13,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 973.02 ms. Allocated memory was 146.3 MB in the beginning and 201.9 MB in the end (delta: 55.6 MB). Free memory was 102.3 MB in the beginning and 156.0 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-19 04:35:13,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.22 ms. Allocated memory is still 201.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:35:13,405 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 04:35:13,405 INFO L168 Benchmark]: RCFGBuilder took 820.30 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 106.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-19 04:35:13,405 INFO L168 Benchmark]: TraceAbstraction took 64791.68 ms. Allocated memory was 201.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 106.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 292.0 MB. Max. memory is 7.1 GB. [2019-12-19 04:35:13,407 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.54 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 973.02 ms. Allocated memory was 146.3 MB in the beginning and 201.9 MB in the end (delta: 55.6 MB). Free memory was 102.3 MB in the beginning and 156.0 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.22 ms. Allocated memory is still 201.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.98 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.30 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 106.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64791.68 ms. Allocated memory was 201.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 106.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 292.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 64.4s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9953 SDtfs, 10503 SDslu, 22865 SDs, 0 SdLazy, 9496 SolverSat, 631 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 107 SyntacticMatches, 25 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84350occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 168101 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2947 NumberOfCodeBlocks, 2947 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2815 ConstructedInterpolants, 0 QuantifiedInterpolants, 514027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...