./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d09e5902c3e47c1de0260aa103bb8e06a6e05e27 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 23:19:22,706 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 23:19:22,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 23:19:22,719 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 23:19:22,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 23:19:22,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 23:19:22,722 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 23:19:22,724 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 23:19:22,726 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 23:19:22,727 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 23:19:22,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 23:19:22,728 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 23:19:22,729 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 23:19:22,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 23:19:22,732 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 23:19:22,733 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 23:19:22,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 23:19:22,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 23:19:22,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 23:19:22,743 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 23:19:22,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 23:19:22,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 23:19:22,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 23:19:22,755 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 23:19:22,755 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 23:19:22,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 23:19:22,757 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 23:19:22,759 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 23:19:22,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 23:19:22,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 23:19:22,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 23:19:22,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 23:19:22,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 23:19:22,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 23:19:22,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 23:19:22,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 23:19:22,766 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 23:19:22,791 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 23:19:22,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 23:19:22,794 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 23:19:22,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 23:19:22,795 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 23:19:22,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 23:19:22,795 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 23:19:22,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 23:19:22,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 23:19:22,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 23:19:22,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 23:19:22,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 23:19:22,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 23:19:22,798 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 23:19:22,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 23:19:22,798 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 23:19:22,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 23:19:22,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 23:19:22,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 23:19:22,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 23:19:22,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 23:19:22,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:19:22,799 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 23:19:22,799 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 23:19:22,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 23:19:22,800 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 23:19:22,800 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 23:19:22,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 23:19:22,800 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d09e5902c3e47c1de0260aa103bb8e06a6e05e27 [2019-01-12 23:19:22,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 23:19:22,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 23:19:22,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 23:19:22,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 23:19:22,876 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 23:19:22,877 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2019-01-12 23:19:22,937 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1767a4b/4e2722f15b1f49d78eaf2b7613dc745a/FLAGed7b9d9a6 [2019-01-12 23:19:23,528 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 23:19:23,529 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2019-01-12 23:19:23,549 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1767a4b/4e2722f15b1f49d78eaf2b7613dc745a/FLAGed7b9d9a6 [2019-01-12 23:19:23,728 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1767a4b/4e2722f15b1f49d78eaf2b7613dc745a [2019-01-12 23:19:23,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 23:19:23,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 23:19:23,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 23:19:23,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 23:19:23,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 23:19:23,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:19:23" (1/1) ... [2019-01-12 23:19:23,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d33055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:23, skipping insertion in model container [2019-01-12 23:19:23,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:19:23" (1/1) ... [2019-01-12 23:19:23,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 23:19:23,805 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 23:19:24,191 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:19:24,206 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 23:19:24,372 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:19:24,460 INFO L195 MainTranslator]: Completed translation [2019-01-12 23:19:24,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24 WrapperNode [2019-01-12 23:19:24,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 23:19:24,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 23:19:24,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 23:19:24,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 23:19:24,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (1/1) ... [2019-01-12 23:19:24,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (1/1) ... [2019-01-12 23:19:24,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 23:19:24,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 23:19:24,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 23:19:24,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 23:19:24,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (1/1) ... [2019-01-12 23:19:24,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (1/1) ... [2019-01-12 23:19:24,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (1/1) ... [2019-01-12 23:19:24,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (1/1) ... [2019-01-12 23:19:24,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (1/1) ... [2019-01-12 23:19:24,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (1/1) ... [2019-01-12 23:19:24,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (1/1) ... [2019-01-12 23:19:24,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 23:19:24,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 23:19:24,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 23:19:24,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 23:19:24,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (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-01-12 23:19:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 23:19:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 23:19:24,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 23:19:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 23:19:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 23:19:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 23:19:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 23:19:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 23:19:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 23:19:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 23:19:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 23:19:24,646 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 23:19:25,837 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 23:19:25,837 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 23:19:25,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:25 BoogieIcfgContainer [2019-01-12 23:19:25,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 23:19:25,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 23:19:25,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 23:19:25,843 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 23:19:25,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:19:23" (1/3) ... [2019-01-12 23:19:25,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7096da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:19:25, skipping insertion in model container [2019-01-12 23:19:25,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:24" (2/3) ... [2019-01-12 23:19:25,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7096da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:19:25, skipping insertion in model container [2019-01-12 23:19:25,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:25" (3/3) ... [2019-01-12 23:19:25,847 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_rmo.oepc_false-unreach-call.i [2019-01-12 23:19:25,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,894 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,894 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,894 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,895 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,895 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,900 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,900 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,900 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,900 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,901 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,901 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,901 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,901 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,901 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,902 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,902 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,902 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,902 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,903 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,904 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,905 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,905 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,905 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,905 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,905 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,906 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,906 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,906 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,906 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,906 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,907 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,907 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,907 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,907 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,907 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,908 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,909 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,909 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,909 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,909 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,910 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,911 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,911 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,911 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,911 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,911 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,912 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,912 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,912 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,912 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,912 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,912 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,913 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,913 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,913 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,913 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,914 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,914 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,914 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,914 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,914 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,915 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:19:25,958 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 23:19:25,959 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 23:19:25,968 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 23:19:25,985 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 23:19:26,010 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 23:19:26,010 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 23:19:26,010 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 23:19:26,011 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 23:19:26,011 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 23:19:26,011 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 23:19:26,011 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 23:19:26,011 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 23:19:26,011 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 23:19:26,026 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2019-01-12 23:19:28,370 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2019-01-12 23:19:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2019-01-12 23:19:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 23:19:28,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:28,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:28,385 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:28,391 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2019-01-12 23:19:28,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:28,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:28,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:28,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:28,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:28,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:28,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:28,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:28,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:28,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:28,879 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2019-01-12 23:19:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:30,274 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2019-01-12 23:19:30,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:19:30,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-12 23:19:30,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:30,654 INFO L225 Difference]: With dead ends: 60793 [2019-01-12 23:19:30,654 INFO L226 Difference]: Without dead ends: 44273 [2019-01-12 23:19:30,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2019-01-12 23:19:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2019-01-12 23:19:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2019-01-12 23:19:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2019-01-12 23:19:32,377 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2019-01-12 23:19:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:32,379 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2019-01-12 23:19:32,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2019-01-12 23:19:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 23:19:32,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:32,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:32,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:32,389 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2019-01-12 23:19:32,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:32,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:32,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:32,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:32,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:32,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:32,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:19:32,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:19:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:19:32,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:32,561 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 5 states. [2019-01-12 23:19:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:35,804 INFO L93 Difference]: Finished difference Result 64007 states and 235337 transitions. [2019-01-12 23:19:35,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:19:35,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 23:19:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:36,548 INFO L225 Difference]: With dead ends: 64007 [2019-01-12 23:19:36,548 INFO L226 Difference]: Without dead ends: 63455 [2019-01-12 23:19:36,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:19:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63455 states. [2019-01-12 23:19:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63455 to 41423. [2019-01-12 23:19:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41423 states. [2019-01-12 23:19:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41423 states to 41423 states and 152332 transitions. [2019-01-12 23:19:38,043 INFO L78 Accepts]: Start accepts. Automaton has 41423 states and 152332 transitions. Word has length 48 [2019-01-12 23:19:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:38,045 INFO L480 AbstractCegarLoop]: Abstraction has 41423 states and 152332 transitions. [2019-01-12 23:19:38,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:19:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 41423 states and 152332 transitions. [2019-01-12 23:19:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 23:19:38,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:38,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:38,053 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2019-01-12 23:19:38,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:38,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:38,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:38,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:38,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:38,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:38,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:38,244 INFO L87 Difference]: Start difference. First operand 41423 states and 152332 transitions. Second operand 6 states. [2019-01-12 23:19:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:39,589 INFO L93 Difference]: Finished difference Result 52773 states and 191027 transitions. [2019-01-12 23:19:39,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:19:39,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-01-12 23:19:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:39,735 INFO L225 Difference]: With dead ends: 52773 [2019-01-12 23:19:39,735 INFO L226 Difference]: Without dead ends: 52261 [2019-01-12 23:19:39,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:19:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52261 states. [2019-01-12 23:19:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52261 to 45377. [2019-01-12 23:19:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45377 states. [2019-01-12 23:19:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45377 states to 45377 states and 166020 transitions. [2019-01-12 23:19:41,593 INFO L78 Accepts]: Start accepts. Automaton has 45377 states and 166020 transitions. Word has length 49 [2019-01-12 23:19:41,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:41,594 INFO L480 AbstractCegarLoop]: Abstraction has 45377 states and 166020 transitions. [2019-01-12 23:19:41,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:19:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 45377 states and 166020 transitions. [2019-01-12 23:19:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 23:19:41,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:41,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:41,605 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2019-01-12 23:19:41,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:41,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:41,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:41,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:41,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:41,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:19:41,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:19:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:19:41,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:19:41,673 INFO L87 Difference]: Start difference. First operand 45377 states and 166020 transitions. Second operand 3 states. [2019-01-12 23:19:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:41,982 INFO L93 Difference]: Finished difference Result 65253 states and 235816 transitions. [2019-01-12 23:19:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:19:41,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-12 23:19:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:42,171 INFO L225 Difference]: With dead ends: 65253 [2019-01-12 23:19:42,171 INFO L226 Difference]: Without dead ends: 65253 [2019-01-12 23:19:42,172 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-01-12 23:19:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-01-12 23:19:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 50947. [2019-01-12 23:19:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50947 states. [2019-01-12 23:19:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50947 states to 50947 states and 184327 transitions. [2019-01-12 23:19:43,320 INFO L78 Accepts]: Start accepts. Automaton has 50947 states and 184327 transitions. Word has length 51 [2019-01-12 23:19:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:43,321 INFO L480 AbstractCegarLoop]: Abstraction has 50947 states and 184327 transitions. [2019-01-12 23:19:43,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:19:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 50947 states and 184327 transitions. [2019-01-12 23:19:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:19:43,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:43,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:43,340 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:43,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1723497845, now seen corresponding path program 1 times [2019-01-12 23:19:43,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:43,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:43,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:43,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:43,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:43,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:43,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:19:43,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:19:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:19:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:19:43,562 INFO L87 Difference]: Start difference. First operand 50947 states and 184327 transitions. Second operand 7 states. [2019-01-12 23:19:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:46,454 INFO L93 Difference]: Finished difference Result 83876 states and 290140 transitions. [2019-01-12 23:19:46,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 23:19:46,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-01-12 23:19:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:46,633 INFO L225 Difference]: With dead ends: 83876 [2019-01-12 23:19:46,633 INFO L226 Difference]: Without dead ends: 83876 [2019-01-12 23:19:46,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:19:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83876 states. [2019-01-12 23:19:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83876 to 66523. [2019-01-12 23:19:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66523 states. [2019-01-12 23:19:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66523 states to 66523 states and 234927 transitions. [2019-01-12 23:19:47,987 INFO L78 Accepts]: Start accepts. Automaton has 66523 states and 234927 transitions. Word has length 55 [2019-01-12 23:19:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:47,988 INFO L480 AbstractCegarLoop]: Abstraction has 66523 states and 234927 transitions. [2019-01-12 23:19:47,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:19:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 66523 states and 234927 transitions. [2019-01-12 23:19:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:19:51,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:51,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:51,724 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:51,725 INFO L82 PathProgramCache]: Analyzing trace with hash -835994164, now seen corresponding path program 1 times [2019-01-12 23:19:51,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:51,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:51,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:51,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:51,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:51,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:51,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:51,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:51,915 INFO L87 Difference]: Start difference. First operand 66523 states and 234927 transitions. Second operand 4 states. [2019-01-12 23:19:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:52,095 INFO L93 Difference]: Finished difference Result 14673 states and 46636 transitions. [2019-01-12 23:19:52,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:19:52,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-12 23:19:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:52,117 INFO L225 Difference]: With dead ends: 14673 [2019-01-12 23:19:52,117 INFO L226 Difference]: Without dead ends: 13087 [2019-01-12 23:19:52,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2019-01-12 23:19:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 13038. [2019-01-12 23:19:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-01-12 23:19:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41162 transitions. [2019-01-12 23:19:52,284 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41162 transitions. Word has length 55 [2019-01-12 23:19:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:52,284 INFO L480 AbstractCegarLoop]: Abstraction has 13038 states and 41162 transitions. [2019-01-12 23:19:52,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41162 transitions. [2019-01-12 23:19:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 23:19:52,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:52,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:52,287 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2019-01-12 23:19:52,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:52,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:52,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:52,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:52,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:52,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:52,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:52,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:52,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:52,399 INFO L87 Difference]: Start difference. First operand 13038 states and 41162 transitions. Second operand 6 states. [2019-01-12 23:19:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:52,918 INFO L93 Difference]: Finished difference Result 19060 states and 59763 transitions. [2019-01-12 23:19:52,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:19:52,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-01-12 23:19:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:52,947 INFO L225 Difference]: With dead ends: 19060 [2019-01-12 23:19:52,948 INFO L226 Difference]: Without dead ends: 18988 [2019-01-12 23:19:52,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:19:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18988 states. [2019-01-12 23:19:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18988 to 13596. [2019-01-12 23:19:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13596 states. [2019-01-12 23:19:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 42815 transitions. [2019-01-12 23:19:53,161 INFO L78 Accepts]: Start accepts. Automaton has 13596 states and 42815 transitions. Word has length 55 [2019-01-12 23:19:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:53,161 INFO L480 AbstractCegarLoop]: Abstraction has 13596 states and 42815 transitions. [2019-01-12 23:19:53,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:19:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 13596 states and 42815 transitions. [2019-01-12 23:19:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 23:19:53,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:53,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:53,167 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:53,168 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2019-01-12 23:19:53,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:53,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:53,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:53,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:53,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:53,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:53,385 INFO L87 Difference]: Start difference. First operand 13596 states and 42815 transitions. Second operand 4 states. [2019-01-12 23:19:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:53,581 INFO L93 Difference]: Finished difference Result 15779 states and 49765 transitions. [2019-01-12 23:19:53,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:19:53,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-01-12 23:19:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:53,606 INFO L225 Difference]: With dead ends: 15779 [2019-01-12 23:19:53,606 INFO L226 Difference]: Without dead ends: 15779 [2019-01-12 23:19:53,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:19:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15779 states. [2019-01-12 23:19:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15779 to 14376. [2019-01-12 23:19:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14376 states. [2019-01-12 23:19:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14376 states to 14376 states and 45279 transitions. [2019-01-12 23:19:53,806 INFO L78 Accepts]: Start accepts. Automaton has 14376 states and 45279 transitions. Word has length 63 [2019-01-12 23:19:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:53,806 INFO L480 AbstractCegarLoop]: Abstraction has 14376 states and 45279 transitions. [2019-01-12 23:19:53,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 14376 states and 45279 transitions. [2019-01-12 23:19:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 23:19:53,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:53,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:53,811 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:53,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2019-01-12 23:19:53,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:53,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:54,098 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 23:19:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:54,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:54,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:19:54,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:19:54,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:19:54,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:19:54,293 INFO L87 Difference]: Start difference. First operand 14376 states and 45279 transitions. Second operand 8 states. [2019-01-12 23:19:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:55,423 INFO L93 Difference]: Finished difference Result 19042 states and 58902 transitions. [2019-01-12 23:19:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:19:55,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-01-12 23:19:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:55,453 INFO L225 Difference]: With dead ends: 19042 [2019-01-12 23:19:55,453 INFO L226 Difference]: Without dead ends: 18971 [2019-01-12 23:19:55,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:19:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18971 states. [2019-01-12 23:19:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18971 to 16646. [2019-01-12 23:19:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16646 states. [2019-01-12 23:19:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16646 states to 16646 states and 51931 transitions. [2019-01-12 23:19:55,679 INFO L78 Accepts]: Start accepts. Automaton has 16646 states and 51931 transitions. Word has length 63 [2019-01-12 23:19:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:55,680 INFO L480 AbstractCegarLoop]: Abstraction has 16646 states and 51931 transitions. [2019-01-12 23:19:55,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:19:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 16646 states and 51931 transitions. [2019-01-12 23:19:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:19:55,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:55,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:55,688 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:55,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1725745967, now seen corresponding path program 1 times [2019-01-12 23:19:55,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:55,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:55,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:55,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:55,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:19:55,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:19:55,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:19:55,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:55,955 INFO L87 Difference]: Start difference. First operand 16646 states and 51931 transitions. Second operand 4 states. [2019-01-12 23:19:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:56,472 INFO L93 Difference]: Finished difference Result 20582 states and 63398 transitions. [2019-01-12 23:19:56,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:19:56,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-12 23:19:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:56,503 INFO L225 Difference]: With dead ends: 20582 [2019-01-12 23:19:56,504 INFO L226 Difference]: Without dead ends: 20582 [2019-01-12 23:19:56,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:19:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20582 states. [2019-01-12 23:19:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20582 to 18532. [2019-01-12 23:19:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18532 states. [2019-01-12 23:19:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18532 states to 18532 states and 57288 transitions. [2019-01-12 23:19:56,747 INFO L78 Accepts]: Start accepts. Automaton has 18532 states and 57288 transitions. Word has length 67 [2019-01-12 23:19:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:56,747 INFO L480 AbstractCegarLoop]: Abstraction has 18532 states and 57288 transitions. [2019-01-12 23:19:56,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:19:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 18532 states and 57288 transitions. [2019-01-12 23:19:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:19:56,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:56,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:56,757 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 492011986, now seen corresponding path program 1 times [2019-01-12 23:19:56,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:56,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:56,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:56,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:56,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:19:56,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:19:56,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:19:56,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:19:56,881 INFO L87 Difference]: Start difference. First operand 18532 states and 57288 transitions. Second operand 3 states. [2019-01-12 23:19:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:57,930 INFO L93 Difference]: Finished difference Result 19140 states and 58939 transitions. [2019-01-12 23:19:57,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:19:57,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-12 23:19:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:57,962 INFO L225 Difference]: With dead ends: 19140 [2019-01-12 23:19:57,962 INFO L226 Difference]: Without dead ends: 19140 [2019-01-12 23:19:57,963 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-01-12 23:19:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19140 states. [2019-01-12 23:19:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19140 to 18856. [2019-01-12 23:19:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18856 states. [2019-01-12 23:19:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18856 states to 18856 states and 58160 transitions. [2019-01-12 23:19:58,204 INFO L78 Accepts]: Start accepts. Automaton has 18856 states and 58160 transitions. Word has length 67 [2019-01-12 23:19:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:58,204 INFO L480 AbstractCegarLoop]: Abstraction has 18856 states and 58160 transitions. [2019-01-12 23:19:58,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:19:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 18856 states and 58160 transitions. [2019-01-12 23:19:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:58,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:58,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:58,215 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2096525335, now seen corresponding path program 1 times [2019-01-12 23:19:58,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:58,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:58,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:58,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:58,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:58,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:58,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:19:58,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:19:58,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:19:58,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:19:58,345 INFO L87 Difference]: Start difference. First operand 18856 states and 58160 transitions. Second operand 3 states. [2019-01-12 23:19:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:19:58,665 INFO L93 Difference]: Finished difference Result 24076 states and 74215 transitions. [2019-01-12 23:19:58,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:19:58,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-12 23:19:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:19:58,702 INFO L225 Difference]: With dead ends: 24076 [2019-01-12 23:19:58,702 INFO L226 Difference]: Without dead ends: 24076 [2019-01-12 23:19:58,702 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-01-12 23:19:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24076 states. [2019-01-12 23:19:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24076 to 23284. [2019-01-12 23:19:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23284 states. [2019-01-12 23:19:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 71849 transitions. [2019-01-12 23:19:59,011 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 71849 transitions. Word has length 69 [2019-01-12 23:19:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:19:59,012 INFO L480 AbstractCegarLoop]: Abstraction has 23284 states and 71849 transitions. [2019-01-12 23:19:59,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:19:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 71849 transitions. [2019-01-12 23:19:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:19:59,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:19:59,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:19:59,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:19:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:19:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash -401490602, now seen corresponding path program 1 times [2019-01-12 23:19:59,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:19:59,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:19:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:59,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:19:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:19:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:19:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:19:59,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:19:59,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:19:59,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:19:59,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:19:59,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:19:59,178 INFO L87 Difference]: Start difference. First operand 23284 states and 71849 transitions. Second operand 6 states. [2019-01-12 23:20:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:00,428 INFO L93 Difference]: Finished difference Result 27964 states and 85091 transitions. [2019-01-12 23:20:00,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:20:00,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-01-12 23:20:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:00,487 INFO L225 Difference]: With dead ends: 27964 [2019-01-12 23:20:00,487 INFO L226 Difference]: Without dead ends: 27964 [2019-01-12 23:20:00,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27964 states. [2019-01-12 23:20:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27964 to 26476. [2019-01-12 23:20:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26476 states. [2019-01-12 23:20:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26476 states to 26476 states and 81094 transitions. [2019-01-12 23:20:00,845 INFO L78 Accepts]: Start accepts. Automaton has 26476 states and 81094 transitions. Word has length 69 [2019-01-12 23:20:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:00,845 INFO L480 AbstractCegarLoop]: Abstraction has 26476 states and 81094 transitions. [2019-01-12 23:20:00,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:20:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 26476 states and 81094 transitions. [2019-01-12 23:20:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:20:00,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:00,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:00,858 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1816267351, now seen corresponding path program 1 times [2019-01-12 23:20:00,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:00,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:00,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:00,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:00,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:01,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:01,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:20:01,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:20:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:20:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:20:01,165 INFO L87 Difference]: Start difference. First operand 26476 states and 81094 transitions. Second operand 6 states. [2019-01-12 23:20:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:01,829 INFO L93 Difference]: Finished difference Result 30144 states and 89716 transitions. [2019-01-12 23:20:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:20:01,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-01-12 23:20:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:01,874 INFO L225 Difference]: With dead ends: 30144 [2019-01-12 23:20:01,875 INFO L226 Difference]: Without dead ends: 30144 [2019-01-12 23:20:01,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:20:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30144 states. [2019-01-12 23:20:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30144 to 26872. [2019-01-12 23:20:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26872 states. [2019-01-12 23:20:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26872 states to 26872 states and 81197 transitions. [2019-01-12 23:20:02,255 INFO L78 Accepts]: Start accepts. Automaton has 26872 states and 81197 transitions. Word has length 69 [2019-01-12 23:20:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:02,256 INFO L480 AbstractCegarLoop]: Abstraction has 26872 states and 81197 transitions. [2019-01-12 23:20:02,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:20:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 26872 states and 81197 transitions. [2019-01-12 23:20:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:20:02,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:02,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:02,270 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2027618264, now seen corresponding path program 1 times [2019-01-12 23:20:02,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:02,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:02,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:02,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:02,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:20:02,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:20:02,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:20:02,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:02,394 INFO L87 Difference]: Start difference. First operand 26872 states and 81197 transitions. Second operand 5 states. [2019-01-12 23:20:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:02,896 INFO L93 Difference]: Finished difference Result 32055 states and 96368 transitions. [2019-01-12 23:20:02,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:20:02,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-01-12 23:20:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:02,944 INFO L225 Difference]: With dead ends: 32055 [2019-01-12 23:20:02,945 INFO L226 Difference]: Without dead ends: 32055 [2019-01-12 23:20:02,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32055 states. [2019-01-12 23:20:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32055 to 29288. [2019-01-12 23:20:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2019-01-12 23:20:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87955 transitions. [2019-01-12 23:20:03,355 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87955 transitions. Word has length 69 [2019-01-12 23:20:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:03,355 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87955 transitions. [2019-01-12 23:20:03,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:20:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87955 transitions. [2019-01-12 23:20:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:20:03,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:03,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:03,367 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash -279867272, now seen corresponding path program 1 times [2019-01-12 23:20:03,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:03,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:03,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:03,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:20:03,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:20:03,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:20:03,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:20:03,455 INFO L87 Difference]: Start difference. First operand 29288 states and 87955 transitions. Second operand 3 states. [2019-01-12 23:20:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:03,948 INFO L93 Difference]: Finished difference Result 41748 states and 124592 transitions. [2019-01-12 23:20:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:20:03,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-12 23:20:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:04,012 INFO L225 Difference]: With dead ends: 41748 [2019-01-12 23:20:04,012 INFO L226 Difference]: Without dead ends: 41748 [2019-01-12 23:20:04,013 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-01-12 23:20:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41748 states. [2019-01-12 23:20:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41748 to 31196. [2019-01-12 23:20:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31196 states. [2019-01-12 23:20:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31196 states to 31196 states and 94070 transitions. [2019-01-12 23:20:04,493 INFO L78 Accepts]: Start accepts. Automaton has 31196 states and 94070 transitions. Word has length 69 [2019-01-12 23:20:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:04,493 INFO L480 AbstractCegarLoop]: Abstraction has 31196 states and 94070 transitions. [2019-01-12 23:20:04,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:20:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31196 states and 94070 transitions. [2019-01-12 23:20:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:20:04,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:04,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:04,504 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2019-01-12 23:20:04,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:04,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:04,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:04,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:04,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:20:04,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:20:04,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:20:04,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:04,580 INFO L87 Difference]: Start difference. First operand 31196 states and 94070 transitions. Second operand 5 states. [2019-01-12 23:20:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:04,660 INFO L93 Difference]: Finished difference Result 7936 states and 19189 transitions. [2019-01-12 23:20:04,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:20:04,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-01-12 23:20:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:04,668 INFO L225 Difference]: With dead ends: 7936 [2019-01-12 23:20:04,668 INFO L226 Difference]: Without dead ends: 6454 [2019-01-12 23:20:04,669 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-01-12 23:20:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6454 states. [2019-01-12 23:20:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6454 to 5802. [2019-01-12 23:20:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5802 states. [2019-01-12 23:20:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5802 states to 5802 states and 13607 transitions. [2019-01-12 23:20:04,729 INFO L78 Accepts]: Start accepts. Automaton has 5802 states and 13607 transitions. Word has length 69 [2019-01-12 23:20:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:04,730 INFO L480 AbstractCegarLoop]: Abstraction has 5802 states and 13607 transitions. [2019-01-12 23:20:04,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:20:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 5802 states and 13607 transitions. [2019-01-12 23:20:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 23:20:04,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:04,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:04,735 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2019-01-12 23:20:04,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:04,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:04,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:20:04,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:20:04,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:20:04,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:20:04,810 INFO L87 Difference]: Start difference. First operand 5802 states and 13607 transitions. Second operand 3 states. [2019-01-12 23:20:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:04,935 INFO L93 Difference]: Finished difference Result 7700 states and 17933 transitions. [2019-01-12 23:20:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:20:04,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-12 23:20:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:04,943 INFO L225 Difference]: With dead ends: 7700 [2019-01-12 23:20:04,944 INFO L226 Difference]: Without dead ends: 7700 [2019-01-12 23:20:04,944 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-01-12 23:20:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7700 states. [2019-01-12 23:20:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7700 to 5741. [2019-01-12 23:20:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5741 states. [2019-01-12 23:20:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5741 states to 5741 states and 13147 transitions. [2019-01-12 23:20:05,008 INFO L78 Accepts]: Start accepts. Automaton has 5741 states and 13147 transitions. Word has length 69 [2019-01-12 23:20:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:05,008 INFO L480 AbstractCegarLoop]: Abstraction has 5741 states and 13147 transitions. [2019-01-12 23:20:05,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:20:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 13147 transitions. [2019-01-12 23:20:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 23:20:05,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:05,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:05,014 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:05,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2019-01-12 23:20:05,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:05,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:05,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:05,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:05,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:05,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:05,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:20:05,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:20:05,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:20:05,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:05,323 INFO L87 Difference]: Start difference. First operand 5741 states and 13147 transitions. Second operand 5 states. [2019-01-12 23:20:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:05,523 INFO L93 Difference]: Finished difference Result 6905 states and 15771 transitions. [2019-01-12 23:20:05,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:20:05,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-01-12 23:20:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:05,532 INFO L225 Difference]: With dead ends: 6905 [2019-01-12 23:20:05,533 INFO L226 Difference]: Without dead ends: 6905 [2019-01-12 23:20:05,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:20:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6905 states. [2019-01-12 23:20:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6905 to 6185. [2019-01-12 23:20:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2019-01-12 23:20:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 14151 transitions. [2019-01-12 23:20:05,596 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 14151 transitions. Word has length 75 [2019-01-12 23:20:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:05,597 INFO L480 AbstractCegarLoop]: Abstraction has 6185 states and 14151 transitions. [2019-01-12 23:20:05,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:20:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 14151 transitions. [2019-01-12 23:20:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 23:20:05,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:05,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:05,604 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:05,604 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2019-01-12 23:20:05,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:05,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:05,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:05,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:05,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:20:05,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:20:05,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:20:05,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:05,847 INFO L87 Difference]: Start difference. First operand 6185 states and 14151 transitions. Second operand 7 states. [2019-01-12 23:20:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:06,336 INFO L93 Difference]: Finished difference Result 7563 states and 17122 transitions. [2019-01-12 23:20:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:20:06,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-01-12 23:20:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:06,345 INFO L225 Difference]: With dead ends: 7563 [2019-01-12 23:20:06,345 INFO L226 Difference]: Without dead ends: 7444 [2019-01-12 23:20:06,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-12 23:20:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7444 states. [2019-01-12 23:20:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7444 to 6282. [2019-01-12 23:20:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6282 states. [2019-01-12 23:20:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 14244 transitions. [2019-01-12 23:20:06,412 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 14244 transitions. Word has length 75 [2019-01-12 23:20:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:06,412 INFO L480 AbstractCegarLoop]: Abstraction has 6282 states and 14244 transitions. [2019-01-12 23:20:06,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:20:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 14244 transitions. [2019-01-12 23:20:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:20:06,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:06,419 INFO L402 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] [2019-01-12 23:20:06,420 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:06,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1874738626, now seen corresponding path program 1 times [2019-01-12 23:20:06,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:06,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:06,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:06,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:06,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:20:06,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:20:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:20:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:06,612 INFO L87 Difference]: Start difference. First operand 6282 states and 14244 transitions. Second operand 4 states. [2019-01-12 23:20:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:07,193 INFO L93 Difference]: Finished difference Result 10017 states and 22619 transitions. [2019-01-12 23:20:07,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:20:07,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-12 23:20:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:07,206 INFO L225 Difference]: With dead ends: 10017 [2019-01-12 23:20:07,206 INFO L226 Difference]: Without dead ends: 10017 [2019-01-12 23:20:07,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10017 states. [2019-01-12 23:20:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10017 to 7402. [2019-01-12 23:20:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7402 states. [2019-01-12 23:20:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 16578 transitions. [2019-01-12 23:20:07,292 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 16578 transitions. Word has length 94 [2019-01-12 23:20:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:07,293 INFO L480 AbstractCegarLoop]: Abstraction has 7402 states and 16578 transitions. [2019-01-12 23:20:07,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:20:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 16578 transitions. [2019-01-12 23:20:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:20:07,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:07,302 INFO L402 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] [2019-01-12 23:20:07,302 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:07,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1947207202, now seen corresponding path program 2 times [2019-01-12 23:20:07,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:07,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:07,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:07,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:07,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:07,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:07,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:20:07,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:20:07,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:20:07,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:07,509 INFO L87 Difference]: Start difference. First operand 7402 states and 16578 transitions. Second operand 4 states. [2019-01-12 23:20:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:08,951 INFO L93 Difference]: Finished difference Result 10390 states and 22984 transitions. [2019-01-12 23:20:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:20:08,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-12 23:20:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:08,964 INFO L225 Difference]: With dead ends: 10390 [2019-01-12 23:20:08,964 INFO L226 Difference]: Without dead ends: 10390 [2019-01-12 23:20:08,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10390 states. [2019-01-12 23:20:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10390 to 8515. [2019-01-12 23:20:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2019-01-12 23:20:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 19095 transitions. [2019-01-12 23:20:09,056 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 19095 transitions. Word has length 94 [2019-01-12 23:20:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:09,057 INFO L480 AbstractCegarLoop]: Abstraction has 8515 states and 19095 transitions. [2019-01-12 23:20:09,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:20:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 19095 transitions. [2019-01-12 23:20:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:20:09,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:09,068 INFO L402 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] [2019-01-12 23:20:09,068 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1945663173, now seen corresponding path program 1 times [2019-01-12 23:20:09,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:09,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:09,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:09,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:09,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:09,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:20:09,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:20:09,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:20:09,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:20:09,223 INFO L87 Difference]: Start difference. First operand 8515 states and 19095 transitions. Second operand 4 states. [2019-01-12 23:20:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:09,345 INFO L93 Difference]: Finished difference Result 8204 states and 18457 transitions. [2019-01-12 23:20:09,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:20:09,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-12 23:20:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:09,355 INFO L225 Difference]: With dead ends: 8204 [2019-01-12 23:20:09,355 INFO L226 Difference]: Without dead ends: 8204 [2019-01-12 23:20:09,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2019-01-12 23:20:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 7608. [2019-01-12 23:20:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7608 states. [2019-01-12 23:20:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7608 states to 7608 states and 17194 transitions. [2019-01-12 23:20:09,439 INFO L78 Accepts]: Start accepts. Automaton has 7608 states and 17194 transitions. Word has length 94 [2019-01-12 23:20:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:09,439 INFO L480 AbstractCegarLoop]: Abstraction has 7608 states and 17194 transitions. [2019-01-12 23:20:09,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:20:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7608 states and 17194 transitions. [2019-01-12 23:20:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:20:09,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:09,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:09,447 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:09,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:09,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1777281593, now seen corresponding path program 1 times [2019-01-12 23:20:09,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:09,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:09,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:09,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:09,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:09,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:09,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:20:09,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:20:09,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:20:09,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:09,657 INFO L87 Difference]: Start difference. First operand 7608 states and 17194 transitions. Second operand 7 states. [2019-01-12 23:20:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:10,380 INFO L93 Difference]: Finished difference Result 9491 states and 21419 transitions. [2019-01-12 23:20:10,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:20:10,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-12 23:20:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:10,393 INFO L225 Difference]: With dead ends: 9491 [2019-01-12 23:20:10,393 INFO L226 Difference]: Without dead ends: 9491 [2019-01-12 23:20:10,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9491 states. [2019-01-12 23:20:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9491 to 7697. [2019-01-12 23:20:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7697 states. [2019-01-12 23:20:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7697 states to 7697 states and 17465 transitions. [2019-01-12 23:20:10,477 INFO L78 Accepts]: Start accepts. Automaton has 7697 states and 17465 transitions. Word has length 96 [2019-01-12 23:20:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:10,477 INFO L480 AbstractCegarLoop]: Abstraction has 7697 states and 17465 transitions. [2019-01-12 23:20:10,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:20:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 17465 transitions. [2019-01-12 23:20:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:20:10,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:10,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:10,485 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1611485258, now seen corresponding path program 1 times [2019-01-12 23:20:10,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:10,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:10,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:10,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:10,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:20:10,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:20:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:20:10,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:10,835 INFO L87 Difference]: Start difference. First operand 7697 states and 17465 transitions. Second operand 5 states. [2019-01-12 23:20:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:11,189 INFO L93 Difference]: Finished difference Result 8560 states and 19324 transitions. [2019-01-12 23:20:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:20:11,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-01-12 23:20:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:11,200 INFO L225 Difference]: With dead ends: 8560 [2019-01-12 23:20:11,200 INFO L226 Difference]: Without dead ends: 8560 [2019-01-12 23:20:11,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states. [2019-01-12 23:20:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 6593. [2019-01-12 23:20:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6593 states. [2019-01-12 23:20:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 14984 transitions. [2019-01-12 23:20:11,272 INFO L78 Accepts]: Start accepts. Automaton has 6593 states and 14984 transitions. Word has length 96 [2019-01-12 23:20:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:11,273 INFO L480 AbstractCegarLoop]: Abstraction has 6593 states and 14984 transitions. [2019-01-12 23:20:11,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:20:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6593 states and 14984 transitions. [2019-01-12 23:20:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:20:11,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:11,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:11,280 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:11,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1356748713, now seen corresponding path program 1 times [2019-01-12 23:20:11,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:11,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:11,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:11,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:11,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:11,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:11,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:20:11,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:20:11,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:20:11,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:20:11,424 INFO L87 Difference]: Start difference. First operand 6593 states and 14984 transitions. Second operand 5 states. [2019-01-12 23:20:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:11,989 INFO L93 Difference]: Finished difference Result 10094 states and 22980 transitions. [2019-01-12 23:20:11,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:20:11,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-01-12 23:20:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:12,001 INFO L225 Difference]: With dead ends: 10094 [2019-01-12 23:20:12,001 INFO L226 Difference]: Without dead ends: 10016 [2019-01-12 23:20:12,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:20:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10016 states. [2019-01-12 23:20:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10016 to 7487. [2019-01-12 23:20:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7487 states. [2019-01-12 23:20:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7487 states to 7487 states and 17008 transitions. [2019-01-12 23:20:12,086 INFO L78 Accepts]: Start accepts. Automaton has 7487 states and 17008 transitions. Word has length 96 [2019-01-12 23:20:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:12,087 INFO L480 AbstractCegarLoop]: Abstraction has 7487 states and 17008 transitions. [2019-01-12 23:20:12,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:20:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 7487 states and 17008 transitions. [2019-01-12 23:20:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:20:12,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:12,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:12,094 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:12,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1693454102, now seen corresponding path program 1 times [2019-01-12 23:20:12,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:12,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:12,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:12,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:12,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:12,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:12,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:20:12,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:20:12,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:20:12,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:20:12,231 INFO L87 Difference]: Start difference. First operand 7487 states and 17008 transitions. Second operand 6 states. [2019-01-12 23:20:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:12,650 INFO L93 Difference]: Finished difference Result 9453 states and 21289 transitions. [2019-01-12 23:20:12,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 23:20:12,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-12 23:20:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:12,662 INFO L225 Difference]: With dead ends: 9453 [2019-01-12 23:20:12,662 INFO L226 Difference]: Without dead ends: 9365 [2019-01-12 23:20:12,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:20:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-01-12 23:20:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 7032. [2019-01-12 23:20:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7032 states. [2019-01-12 23:20:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7032 states to 7032 states and 16004 transitions. [2019-01-12 23:20:12,760 INFO L78 Accepts]: Start accepts. Automaton has 7032 states and 16004 transitions. Word has length 96 [2019-01-12 23:20:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:12,761 INFO L480 AbstractCegarLoop]: Abstraction has 7032 states and 16004 transitions. [2019-01-12 23:20:12,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:20:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 7032 states and 16004 transitions. [2019-01-12 23:20:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:20:12,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:12,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:12,770 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash -564113265, now seen corresponding path program 1 times [2019-01-12 23:20:12,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:12,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:12,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:12,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:12,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:12,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:12,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:20:12,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:20:12,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:20:12,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:20:12,941 INFO L87 Difference]: Start difference. First operand 7032 states and 16004 transitions. Second operand 8 states. [2019-01-12 23:20:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:13,519 INFO L93 Difference]: Finished difference Result 10295 states and 23705 transitions. [2019-01-12 23:20:13,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:20:13,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-01-12 23:20:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:13,533 INFO L225 Difference]: With dead ends: 10295 [2019-01-12 23:20:13,533 INFO L226 Difference]: Without dead ends: 10295 [2019-01-12 23:20:13,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-01-12 23:20:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10295 states. [2019-01-12 23:20:13,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10295 to 7469. [2019-01-12 23:20:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2019-01-12 23:20:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 17150 transitions. [2019-01-12 23:20:13,652 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 17150 transitions. Word has length 96 [2019-01-12 23:20:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:13,652 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 17150 transitions. [2019-01-12 23:20:13,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:20:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 17150 transitions. [2019-01-12 23:20:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:20:13,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:13,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:13,661 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:13,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:13,662 INFO L82 PathProgramCache]: Analyzing trace with hash 323390416, now seen corresponding path program 1 times [2019-01-12 23:20:13,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:13,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:13,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:13,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:13,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:13,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:13,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 23:20:13,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 23:20:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 23:20:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:20:13,884 INFO L87 Difference]: Start difference. First operand 7469 states and 17150 transitions. Second operand 10 states. [2019-01-12 23:20:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:15,042 INFO L93 Difference]: Finished difference Result 11592 states and 26583 transitions. [2019-01-12 23:20:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 23:20:15,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-01-12 23:20:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:15,058 INFO L225 Difference]: With dead ends: 11592 [2019-01-12 23:20:15,058 INFO L226 Difference]: Without dead ends: 11592 [2019-01-12 23:20:15,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-01-12 23:20:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11592 states. [2019-01-12 23:20:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11592 to 9095. [2019-01-12 23:20:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9095 states. [2019-01-12 23:20:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9095 states to 9095 states and 20675 transitions. [2019-01-12 23:20:15,215 INFO L78 Accepts]: Start accepts. Automaton has 9095 states and 20675 transitions. Word has length 96 [2019-01-12 23:20:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:15,215 INFO L480 AbstractCegarLoop]: Abstraction has 9095 states and 20675 transitions. [2019-01-12 23:20:15,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 23:20:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9095 states and 20675 transitions. [2019-01-12 23:20:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:20:15,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:15,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:15,224 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1408585136, now seen corresponding path program 1 times [2019-01-12 23:20:15,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:15,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:15,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:15,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:15,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:15,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:15,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:20:15,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:20:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:20:15,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:20:15,430 INFO L87 Difference]: Start difference. First operand 9095 states and 20675 transitions. Second operand 6 states. [2019-01-12 23:20:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:15,573 INFO L93 Difference]: Finished difference Result 8775 states and 19683 transitions. [2019-01-12 23:20:15,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:20:15,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-12 23:20:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:15,585 INFO L225 Difference]: With dead ends: 8775 [2019-01-12 23:20:15,585 INFO L226 Difference]: Without dead ends: 8775 [2019-01-12 23:20:15,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:20:15,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8775 states. [2019-01-12 23:20:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8775 to 7134. [2019-01-12 23:20:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2019-01-12 23:20:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 16071 transitions. [2019-01-12 23:20:15,669 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 16071 transitions. Word has length 96 [2019-01-12 23:20:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:15,669 INFO L480 AbstractCegarLoop]: Abstraction has 7134 states and 16071 transitions. [2019-01-12 23:20:15,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:20:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 16071 transitions. [2019-01-12 23:20:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:15,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:15,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:15,677 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash -287165680, now seen corresponding path program 1 times [2019-01-12 23:20:15,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:15,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:15,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:16,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:16,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 23:20:16,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 23:20:16,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 23:20:16,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:20:16,628 INFO L87 Difference]: Start difference. First operand 7134 states and 16071 transitions. Second operand 13 states. [2019-01-12 23:20:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:17,856 INFO L93 Difference]: Finished difference Result 9861 states and 21847 transitions. [2019-01-12 23:20:17,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 23:20:17,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2019-01-12 23:20:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:17,869 INFO L225 Difference]: With dead ends: 9861 [2019-01-12 23:20:17,869 INFO L226 Difference]: Without dead ends: 9861 [2019-01-12 23:20:17,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-01-12 23:20:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9861 states. [2019-01-12 23:20:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9861 to 7851. [2019-01-12 23:20:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7851 states. [2019-01-12 23:20:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7851 states to 7851 states and 17644 transitions. [2019-01-12 23:20:17,957 INFO L78 Accepts]: Start accepts. Automaton has 7851 states and 17644 transitions. Word has length 98 [2019-01-12 23:20:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:17,957 INFO L480 AbstractCegarLoop]: Abstraction has 7851 states and 17644 transitions. [2019-01-12 23:20:17,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 23:20:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 7851 states and 17644 transitions. [2019-01-12 23:20:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:17,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:17,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:17,965 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:17,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:17,965 INFO L82 PathProgramCache]: Analyzing trace with hash 600338001, now seen corresponding path program 1 times [2019-01-12 23:20:17,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:17,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:17,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:17,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:17,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:18,205 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 23:20:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:18,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:18,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:20:18,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:20:18,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:20:18,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:20:18,282 INFO L87 Difference]: Start difference. First operand 7851 states and 17644 transitions. Second operand 9 states. [2019-01-12 23:20:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:19,182 INFO L93 Difference]: Finished difference Result 12120 states and 27159 transitions. [2019-01-12 23:20:19,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:20:19,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-01-12 23:20:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:19,193 INFO L225 Difference]: With dead ends: 12120 [2019-01-12 23:20:19,193 INFO L226 Difference]: Without dead ends: 8883 [2019-01-12 23:20:19,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:20:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8883 states. [2019-01-12 23:20:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8883 to 7908. [2019-01-12 23:20:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7908 states. [2019-01-12 23:20:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 17761 transitions. [2019-01-12 23:20:19,274 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 17761 transitions. Word has length 98 [2019-01-12 23:20:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:19,275 INFO L480 AbstractCegarLoop]: Abstraction has 7908 states and 17761 transitions. [2019-01-12 23:20:19,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:20:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 17761 transitions. [2019-01-12 23:20:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:19,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:19,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:19,283 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:19,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1430813447, now seen corresponding path program 1 times [2019-01-12 23:20:19,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:19,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:19,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:19,668 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 23:20:19,917 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-12 23:20:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:19,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:19,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:20:19,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:20:19,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:20:19,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:20:19,929 INFO L87 Difference]: Start difference. First operand 7908 states and 17761 transitions. Second operand 6 states. [2019-01-12 23:20:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:20,197 INFO L93 Difference]: Finished difference Result 8785 states and 19481 transitions. [2019-01-12 23:20:20,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:20:20,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-01-12 23:20:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:20,210 INFO L225 Difference]: With dead ends: 8785 [2019-01-12 23:20:20,210 INFO L226 Difference]: Without dead ends: 8735 [2019-01-12 23:20:20,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-01-12 23:20:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7859. [2019-01-12 23:20:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7859 states. [2019-01-12 23:20:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7859 states to 7859 states and 17516 transitions. [2019-01-12 23:20:20,293 INFO L78 Accepts]: Start accepts. Automaton has 7859 states and 17516 transitions. Word has length 98 [2019-01-12 23:20:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:20,293 INFO L480 AbstractCegarLoop]: Abstraction has 7859 states and 17516 transitions. [2019-01-12 23:20:20,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:20:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7859 states and 17516 transitions. [2019-01-12 23:20:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:20,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:20,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:20,302 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash 774269081, now seen corresponding path program 2 times [2019-01-12 23:20:20,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:20,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:20,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:20,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:20,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:20,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:20,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:20:20,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:20:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:20:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:20,896 INFO L87 Difference]: Start difference. First operand 7859 states and 17516 transitions. Second operand 7 states. [2019-01-12 23:20:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:21,243 INFO L93 Difference]: Finished difference Result 9487 states and 20865 transitions. [2019-01-12 23:20:21,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:20:21,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-01-12 23:20:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:21,255 INFO L225 Difference]: With dead ends: 9487 [2019-01-12 23:20:21,255 INFO L226 Difference]: Without dead ends: 9487 [2019-01-12 23:20:21,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:20:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2019-01-12 23:20:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 7884. [2019-01-12 23:20:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7884 states. [2019-01-12 23:20:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7884 states to 7884 states and 17568 transitions. [2019-01-12 23:20:21,339 INFO L78 Accepts]: Start accepts. Automaton has 7884 states and 17568 transitions. Word has length 98 [2019-01-12 23:20:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:21,339 INFO L480 AbstractCegarLoop]: Abstraction has 7884 states and 17568 transitions. [2019-01-12 23:20:21,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:20:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7884 states and 17568 transitions. [2019-01-12 23:20:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:21,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:21,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:21,347 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:21,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1306740200, now seen corresponding path program 2 times [2019-01-12 23:20:21,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:21,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:21,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:21,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:21,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:21,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:21,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:20:21,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:20:21,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:20:21,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:20:21,952 INFO L87 Difference]: Start difference. First operand 7884 states and 17568 transitions. Second operand 8 states. [2019-01-12 23:20:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:22,376 INFO L93 Difference]: Finished difference Result 9422 states and 20846 transitions. [2019-01-12 23:20:22,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 23:20:22,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2019-01-12 23:20:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:22,389 INFO L225 Difference]: With dead ends: 9422 [2019-01-12 23:20:22,389 INFO L226 Difference]: Without dead ends: 9422 [2019-01-12 23:20:22,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-12 23:20:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9422 states. [2019-01-12 23:20:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9422 to 8274. [2019-01-12 23:20:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8274 states. [2019-01-12 23:20:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8274 states to 8274 states and 18395 transitions. [2019-01-12 23:20:22,474 INFO L78 Accepts]: Start accepts. Automaton has 8274 states and 18395 transitions. Word has length 98 [2019-01-12 23:20:22,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:22,474 INFO L480 AbstractCegarLoop]: Abstraction has 8274 states and 18395 transitions. [2019-01-12 23:20:22,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:20:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 8274 states and 18395 transitions. [2019-01-12 23:20:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:22,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:22,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:22,483 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -419236519, now seen corresponding path program 2 times [2019-01-12 23:20:22,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:22,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:22,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:22,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:22,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:20:22,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:20:22,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:20:22,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:20:22,730 INFO L87 Difference]: Start difference. First operand 8274 states and 18395 transitions. Second operand 9 states. [2019-01-12 23:20:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:22,926 INFO L93 Difference]: Finished difference Result 11279 states and 25102 transitions. [2019-01-12 23:20:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:20:22,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-01-12 23:20:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:22,934 INFO L225 Difference]: With dead ends: 11279 [2019-01-12 23:20:22,935 INFO L226 Difference]: Without dead ends: 7208 [2019-01-12 23:20:22,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:20:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7208 states. [2019-01-12 23:20:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7208 to 6395. [2019-01-12 23:20:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6395 states. [2019-01-12 23:20:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 14157 transitions. [2019-01-12 23:20:22,998 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 14157 transitions. Word has length 98 [2019-01-12 23:20:22,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:22,998 INFO L480 AbstractCegarLoop]: Abstraction has 6395 states and 14157 transitions. [2019-01-12 23:20:22,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:20:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 14157 transitions. [2019-01-12 23:20:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:23,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:23,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:23,005 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:23,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1919498867, now seen corresponding path program 3 times [2019-01-12 23:20:23,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:23,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:23,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:23,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:23,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:20:23,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:20:23,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:20:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:20:23,286 INFO L87 Difference]: Start difference. First operand 6395 states and 14157 transitions. Second operand 9 states. [2019-01-12 23:20:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:23,557 INFO L93 Difference]: Finished difference Result 8970 states and 19951 transitions. [2019-01-12 23:20:23,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:20:23,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-01-12 23:20:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:23,568 INFO L225 Difference]: With dead ends: 8970 [2019-01-12 23:20:23,568 INFO L226 Difference]: Without dead ends: 7302 [2019-01-12 23:20:23,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-12 23:20:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-01-12 23:20:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 6462. [2019-01-12 23:20:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6462 states. [2019-01-12 23:20:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 14296 transitions. [2019-01-12 23:20:23,633 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 14296 transitions. Word has length 98 [2019-01-12 23:20:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:23,633 INFO L480 AbstractCegarLoop]: Abstraction has 6462 states and 14296 transitions. [2019-01-12 23:20:23,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:20:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 14296 transitions. [2019-01-12 23:20:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:23,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:23,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:23,641 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2050487941, now seen corresponding path program 4 times [2019-01-12 23:20:23,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:23,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:23,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:23,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:23,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:23,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:23,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 23:20:23,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 23:20:23,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 23:20:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:20:23,859 INFO L87 Difference]: Start difference. First operand 6462 states and 14296 transitions. Second operand 11 states. [2019-01-12 23:20:24,112 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-01-12 23:20:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:26,189 INFO L93 Difference]: Finished difference Result 11999 states and 26613 transitions. [2019-01-12 23:20:26,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 23:20:26,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-01-12 23:20:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:26,200 INFO L225 Difference]: With dead ends: 11999 [2019-01-12 23:20:26,200 INFO L226 Difference]: Without dead ends: 8252 [2019-01-12 23:20:26,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-01-12 23:20:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8252 states. [2019-01-12 23:20:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8252 to 6342. [2019-01-12 23:20:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6342 states. [2019-01-12 23:20:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6342 states to 6342 states and 13974 transitions. [2019-01-12 23:20:26,270 INFO L78 Accepts]: Start accepts. Automaton has 6342 states and 13974 transitions. Word has length 98 [2019-01-12 23:20:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:26,270 INFO L480 AbstractCegarLoop]: Abstraction has 6342 states and 13974 transitions. [2019-01-12 23:20:26,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 23:20:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6342 states and 13974 transitions. [2019-01-12 23:20:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:26,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:26,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:26,279 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1302782348, now seen corresponding path program 1 times [2019-01-12 23:20:26,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:26,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:26,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:20:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:20:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:20:26,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:20:26,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:20:26,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:20:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:20:26,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:20:26,544 INFO L87 Difference]: Start difference. First operand 6342 states and 13974 transitions. Second operand 7 states. [2019-01-12 23:20:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:20:26,949 INFO L93 Difference]: Finished difference Result 6514 states and 14283 transitions. [2019-01-12 23:20:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 23:20:26,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-01-12 23:20:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:20:26,958 INFO L225 Difference]: With dead ends: 6514 [2019-01-12 23:20:26,958 INFO L226 Difference]: Without dead ends: 6514 [2019-01-12 23:20:26,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:20:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-01-12 23:20:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6137. [2019-01-12 23:20:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6137 states. [2019-01-12 23:20:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6137 states to 6137 states and 13518 transitions. [2019-01-12 23:20:27,018 INFO L78 Accepts]: Start accepts. Automaton has 6137 states and 13518 transitions. Word has length 98 [2019-01-12 23:20:27,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:20:27,018 INFO L480 AbstractCegarLoop]: Abstraction has 6137 states and 13518 transitions. [2019-01-12 23:20:27,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:20:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6137 states and 13518 transitions. [2019-01-12 23:20:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 23:20:27,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:20:27,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:20:27,025 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:20:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:20:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1271762541, now seen corresponding path program 5 times [2019-01-12 23:20:27,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:20:27,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:20:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:27,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:20:27,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:20:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:20:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:20:27,116 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 23:20:27,328 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 23:20:27,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:20:27 BasicIcfg [2019-01-12 23:20:27,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 23:20:27,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 23:20:27,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 23:20:27,333 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 23:20:27,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:25" (3/4) ... [2019-01-12 23:20:27,338 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 23:20:27,542 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 23:20:27,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 23:20:27,548 INFO L168 Benchmark]: Toolchain (without parser) took 63815.59 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 952.7 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-01-12 23:20:27,549 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 23:20:27,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:27,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:27,556 INFO L168 Benchmark]: Boogie Preprocessor took 41.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 23:20:27,556 INFO L168 Benchmark]: RCFGBuilder took 1265.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:27,556 INFO L168 Benchmark]: TraceAbstraction took 61491.60 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-01-12 23:20:27,557 INFO L168 Benchmark]: Witness Printer took 213.93 ms. Allocated memory is still 4.7 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2019-01-12 23:20:27,563 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 727.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1265.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61491.60 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 213.93 ms. Allocated memory is still 4.7 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 pthread_t t251; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] FCALL, FORK -1 pthread_create(&t251, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t252; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] FCALL, FORK -1 pthread_create(&t252, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L752] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L754] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L757] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 61.3s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 31.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10403 SDtfs, 12237 SDslu, 25676 SDs, 0 SdLazy, 11720 SolverSat, 638 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 107 SyntacticMatches, 31 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66523occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 12.6s AutomataMinimizationTime, 39 MinimizatonAttempts, 143599 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 3176 NumberOfCodeBlocks, 3176 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3039 ConstructedInterpolants, 0 QuantifiedInterpolants, 715214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...