./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr000_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr000_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer --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 c789dc64a500d158f8c4f6d503d67910c567fa0f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-01 19:17:04,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:17:04,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:17:04,723 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:17:04,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:17:04,724 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:17:04,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:17:04,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:17:04,727 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:17:04,728 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:17:04,729 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:17:04,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:17:04,729 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:17:04,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:17:04,730 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:17:04,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:17:04,731 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:17:04,732 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:17:04,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:17:04,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:17:04,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:17:04,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:17:04,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:17:04,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:17:04,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:17:04,738 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:17:04,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:17:04,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:17:04,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:17:04,740 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:17:04,740 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:17:04,740 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:17:04,740 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:17:04,740 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:17:04,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:17:04,741 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:17:04,741 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 19:17:04,751 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:17:04,751 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:17:04,752 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 19:17:04,752 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 19:17:04,752 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:17:04,753 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:17:04,753 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:17:04,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:17:04,753 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:17:04,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:17:04,753 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:17:04,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:17:04,754 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 19:17:04,754 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 19:17:04,754 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 19:17:04,754 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:17:04,754 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:17:04,754 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:17:04,755 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 19:17:04,755 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:17:04,755 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:17:04,755 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 19:17:04,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 19:17:04,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 19:17:04,756 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:17:04,756 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 19:17:04,756 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 19:17:04,756 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 19:17:04,756 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 19:17:04,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 19:17:04,756 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer 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 -> c789dc64a500d158f8c4f6d503d67910c567fa0f [2018-12-01 19:17:04,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:17:04,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:17:04,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:17:04,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:17:04,789 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:17:04,789 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/podwr000_pso.opt_false-unreach-call.i [2018-12-01 19:17:04,822 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/data/cb9568d99/053a0c94ba9c439eb7ccdd0a396e89ea/FLAG4347e0231 [2018-12-01 19:17:05,291 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:17:05,291 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/sv-benchmarks/c/pthread-wmm/podwr000_pso.opt_false-unreach-call.i [2018-12-01 19:17:05,299 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/data/cb9568d99/053a0c94ba9c439eb7ccdd0a396e89ea/FLAG4347e0231 [2018-12-01 19:17:05,659 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/data/cb9568d99/053a0c94ba9c439eb7ccdd0a396e89ea [2018-12-01 19:17:05,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:17:05,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:17:05,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:17:05,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:17:05,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:17:05,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:17:05" (1/1) ... [2018-12-01 19:17:05,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56412a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:05, skipping insertion in model container [2018-12-01 19:17:05,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:17:05" (1/1) ... [2018-12-01 19:17:05,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:17:05,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:17:05,950 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:17:05,956 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:17:06,019 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:17:06,047 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:17:06,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06 WrapperNode [2018-12-01 19:17:06,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:17:06,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:17:06,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:17:06,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:17:06,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... [2018-12-01 19:17:06,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... [2018-12-01 19:17:06,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:17:06,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:17:06,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:17:06,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:17:06,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... [2018-12-01 19:17:06,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... [2018-12-01 19:17:06,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... [2018-12-01 19:17:06,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... [2018-12-01 19:17:06,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... [2018-12-01 19:17:06,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... [2018-12-01 19:17:06,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... [2018-12-01 19:17:06,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:17:06,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:17:06,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:17:06,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:17:06,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/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 [2018-12-01 19:17:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 19:17:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 19:17:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 19:17:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 19:17:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 19:17:06,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 19:17:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 19:17:06,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 19:17:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 19:17:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:17:06,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:17:06,127 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 19:17:06,426 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:17:06,426 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 19:17:06,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:17:06 BoogieIcfgContainer [2018-12-01 19:17:06,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:17:06,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 19:17:06,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 19:17:06,429 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 19:17:06,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 07:17:05" (1/3) ... [2018-12-01 19:17:06,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5892af66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:17:06, skipping insertion in model container [2018-12-01 19:17:06,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:17:06" (2/3) ... [2018-12-01 19:17:06,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5892af66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:17:06, skipping insertion in model container [2018-12-01 19:17:06,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:17:06" (3/3) ... [2018-12-01 19:17:06,430 INFO L112 eAbstractionObserver]: Analyzing ICFG podwr000_pso.opt_false-unreach-call.i [2018-12-01 19:17:06,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,453 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,453 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,453 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,453 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,453 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,453 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,454 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,455 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,456 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,457 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,458 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,458 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,458 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,458 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,458 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,460 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:17:06,481 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 19:17:06,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 19:17:06,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 19:17:06,496 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 19:17:06,512 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:17:06,512 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 19:17:06,512 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 19:17:06,512 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 19:17:06,512 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:17:06,512 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:17:06,513 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 19:17:06,513 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:17:06,513 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 19:17:06,520 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-01 19:17:07,912 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-01 19:17:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-01 19:17:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 19:17:07,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:07,918 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] [2018-12-01 19:17:07,920 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:07,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-01 19:17:07,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:07,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:07,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:07,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:07,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:08,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:08,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:17:08,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:17:08,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:17:08,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:17:08,068 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-01 19:17:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:08,593 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-01 19:17:08,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:17:08,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-01 19:17:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:08,742 INFO L225 Difference]: With dead ends: 60790 [2018-12-01 19:17:08,742 INFO L226 Difference]: Without dead ends: 44270 [2018-12-01 19:17:08,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:17:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-01 19:17:09,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-01 19:17:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-01 19:17:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-01 19:17:09,525 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-01 19:17:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:09,526 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-01 19:17:09,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:17:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-01 19:17:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 19:17:09,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:09,530 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] [2018-12-01 19:17:09,530 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:09,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-01 19:17:09,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:09,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:09,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:09,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:09,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:09,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:17:09,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:17:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:17:09,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:17:09,590 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-01 19:17:09,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:09,652 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-01 19:17:09,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:17:09,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-01 19:17:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:09,669 INFO L225 Difference]: With dead ends: 8528 [2018-12-01 19:17:09,669 INFO L226 Difference]: Without dead ends: 7466 [2018-12-01 19:17:09,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-01 19:17:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-01 19:17:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-01 19:17:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-01 19:17:09,760 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-01 19:17:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:09,760 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-01 19:17:09,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:17:09,761 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-01 19:17:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 19:17:09,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:09,762 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] [2018-12-01 19:17:09,762 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:09,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-01 19:17:09,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:09,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:09,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:09,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:09,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:17:09,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:17:09,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:17:09,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:09,825 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-01 19:17:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:10,061 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-01 19:17:10,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:17:10,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-01 19:17:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:10,083 INFO L225 Difference]: With dead ends: 13998 [2018-12-01 19:17:10,083 INFO L226 Difference]: Without dead ends: 13930 [2018-12-01 19:17:10,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:17:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-01 19:17:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-01 19:17:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-01 19:17:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-01 19:17:10,278 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-01 19:17:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:10,278 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-01 19:17:10,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:17:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-01 19:17:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-01 19:17:10,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:10,280 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] [2018-12-01 19:17:10,280 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:10,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:10,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-01 19:17:10,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:10,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:10,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:10,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:10,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:17:10,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:17:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:17:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:17:10,308 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-01 19:17:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:10,374 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-01 19:17:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:17:10,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-01 19:17:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:10,391 INFO L225 Difference]: With dead ends: 13279 [2018-12-01 19:17:10,391 INFO L226 Difference]: Without dead ends: 13279 [2018-12-01 19:17:10,391 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 [2018-12-01 19:17:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-01 19:17:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-01 19:17:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-01 19:17:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-01 19:17:10,515 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-01 19:17:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:10,515 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-01 19:17:10,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:17:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-01 19:17:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 19:17:10,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:10,516 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] [2018-12-01 19:17:10,516 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:10,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-01 19:17:10,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:10,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:10,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:10,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:10,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:17:10,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:17:10,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:17:10,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:17:10,586 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-01 19:17:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:10,975 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-01 19:17:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 19:17:10,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-01 19:17:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:10,987 INFO L225 Difference]: With dead ends: 12285 [2018-12-01 19:17:10,988 INFO L226 Difference]: Without dead ends: 12213 [2018-12-01 19:17:10,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-01 19:17:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-01 19:17:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-01 19:17:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-01 19:17:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-01 19:17:11,099 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-01 19:17:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:11,099 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-01 19:17:11,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:17:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-01 19:17:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 19:17:11,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:11,102 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] [2018-12-01 19:17:11,102 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:11,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:11,102 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-01 19:17:11,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:11,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:11,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:11,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:11,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:11,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:17:11,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:17:11,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:17:11,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:17:11,148 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-01 19:17:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:11,257 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-01 19:17:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:17:11,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-01 19:17:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:11,270 INFO L225 Difference]: With dead ends: 12396 [2018-12-01 19:17:11,270 INFO L226 Difference]: Without dead ends: 12396 [2018-12-01 19:17:11,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-01 19:17:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-01 19:17:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-01 19:17:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-01 19:17:11,386 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-01 19:17:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:11,386 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-01 19:17:11,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:17:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-01 19:17:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 19:17:11,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:11,389 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] [2018-12-01 19:17:11,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:11,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-01 19:17:11,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:11,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:11,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:11,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:11,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:17:11,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:17:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:17:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:17:11,458 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-01 19:17:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:11,713 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-01 19:17:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 19:17:11,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-01 19:17:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:11,737 INFO L225 Difference]: With dead ends: 20969 [2018-12-01 19:17:11,737 INFO L226 Difference]: Without dead ends: 20898 [2018-12-01 19:17:11,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:17:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-01 19:17:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-01 19:17:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-01 19:17:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-01 19:17:11,916 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-01 19:17:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:11,916 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-01 19:17:11,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:17:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-01 19:17:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 19:17:11,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:11,921 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] [2018-12-01 19:17:11,921 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:11,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:11,921 INFO L82 PathProgramCache]: Analyzing trace with hash 553940321, now seen corresponding path program 1 times [2018-12-01 19:17:11,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:11,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:11,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:11,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:11,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:17:11,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:17:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:17:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:17:11,966 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-01 19:17:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:12,157 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-01 19:17:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:17:12,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-01 19:17:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:12,176 INFO L225 Difference]: With dead ends: 17635 [2018-12-01 19:17:12,176 INFO L226 Difference]: Without dead ends: 17635 [2018-12-01 19:17:12,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:17:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-01 19:17:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-01 19:17:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-01 19:17:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-01 19:17:12,366 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-01 19:17:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:12,366 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-01 19:17:12,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:17:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-01 19:17:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 19:17:12,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:12,371 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] [2018-12-01 19:17:12,371 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:12,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:12,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1523269022, now seen corresponding path program 1 times [2018-12-01 19:17:12,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:12,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:12,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:12,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:12,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:12,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:12,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:17:12,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:17:12,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:17:12,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:17:12,401 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-01 19:17:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:12,548 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-01 19:17:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:17:12,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-01 19:17:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:12,566 INFO L225 Difference]: With dead ends: 16385 [2018-12-01 19:17:12,566 INFO L226 Difference]: Without dead ends: 16385 [2018-12-01 19:17:12,567 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 [2018-12-01 19:17:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-01 19:17:12,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-01 19:17:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-01 19:17:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-01 19:17:12,796 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-01 19:17:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:12,796 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-01 19:17:12,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:17:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-01 19:17:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 19:17:12,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:12,802 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] [2018-12-01 19:17:12,803 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:12,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash 493974152, now seen corresponding path program 1 times [2018-12-01 19:17:12,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:12,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:12,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:12,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:12,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:17:12,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:17:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:17:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:17:12,851 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-01 19:17:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:13,442 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-01 19:17:13,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:17:13,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-01 19:17:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:13,463 INFO L225 Difference]: With dead ends: 19821 [2018-12-01 19:17:13,463 INFO L226 Difference]: Without dead ends: 19821 [2018-12-01 19:17:13,463 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 [2018-12-01 19:17:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-01 19:17:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-01 19:17:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-01 19:17:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-01 19:17:13,654 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-01 19:17:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:13,654 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-01 19:17:13,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:17:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-01 19:17:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 19:17:13,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17: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] [2018-12-01 19:17:13,661 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:13,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:13,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1583235191, now seen corresponding path program 1 times [2018-12-01 19:17:13,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:13,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:13,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:13,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:13,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:13,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:13,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:17:13,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:17:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:17:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:17:13,749 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-01 19:17:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:14,006 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-01 19:17:14,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 19:17:14,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-01 19:17:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:14,028 INFO L225 Difference]: With dead ends: 21449 [2018-12-01 19:17:14,028 INFO L226 Difference]: Without dead ends: 21449 [2018-12-01 19:17:14,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:17:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-01 19:17:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-01 19:17:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-01 19:17:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-01 19:17:14,228 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-01 19:17:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:14,229 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-01 19:17:14,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:17:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-01 19:17:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 19:17:14,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:14,236 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] [2018-12-01 19:17:14,236 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:14,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1371884278, now seen corresponding path program 1 times [2018-12-01 19:17:14,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:14,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:14,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:14,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:14,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:14,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:14,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:17:14,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:17:14,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:17:14,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:14,293 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-01 19:17:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:14,551 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-01 19:17:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:17:14,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-01 19:17:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:14,576 INFO L225 Difference]: With dead ends: 25024 [2018-12-01 19:17:14,577 INFO L226 Difference]: Without dead ends: 25024 [2018-12-01 19:17:14,577 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 [2018-12-01 19:17:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-01 19:17:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-01 19:17:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-01 19:17:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-01 19:17:14,811 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-01 19:17:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:14,811 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-01 19:17:14,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:17:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-01 19:17:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 19:17:14,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:14,819 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] [2018-12-01 19:17:14,820 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:14,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1882418455, now seen corresponding path program 1 times [2018-12-01 19:17:14,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:14,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:14,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:14,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:14,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:14,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:14,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:17:14,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:17:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:17:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:17:14,877 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 6 states. [2018-12-01 19:17:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:15,379 INFO L93 Difference]: Finished difference Result 30713 states and 93495 transitions. [2018-12-01 19:17:15,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:17:15,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-01 19:17:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:15,413 INFO L225 Difference]: With dead ends: 30713 [2018-12-01 19:17:15,413 INFO L226 Difference]: Without dead ends: 30609 [2018-12-01 19:17:15,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:17:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30609 states. [2018-12-01 19:17:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30609 to 27953. [2018-12-01 19:17:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27953 states. [2018-12-01 19:17:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27953 states to 27953 states and 84685 transitions. [2018-12-01 19:17:15,730 INFO L78 Accepts]: Start accepts. Automaton has 27953 states and 84685 transitions. Word has length 66 [2018-12-01 19:17:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:15,730 INFO L480 AbstractCegarLoop]: Abstraction has 27953 states and 84685 transitions. [2018-12-01 19:17:15,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:17:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 27953 states and 84685 transitions. [2018-12-01 19:17:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 19:17:15,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:15,739 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] [2018-12-01 19:17:15,739 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:15,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:15,740 INFO L82 PathProgramCache]: Analyzing trace with hash -74963992, now seen corresponding path program 1 times [2018-12-01 19:17:15,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:15,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:15,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:15,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:15,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:17:15,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:17:15,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:17:15,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:15,789 INFO L87 Difference]: Start difference. First operand 27953 states and 84685 transitions. Second operand 5 states. [2018-12-01 19:17:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:16,138 INFO L93 Difference]: Finished difference Result 40003 states and 119732 transitions. [2018-12-01 19:17:16,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:17:16,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-01 19:17:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:16,190 INFO L225 Difference]: With dead ends: 40003 [2018-12-01 19:17:16,190 INFO L226 Difference]: Without dead ends: 39851 [2018-12-01 19:17:16,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:17:16,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39851 states. [2018-12-01 19:17:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39851 to 35599. [2018-12-01 19:17:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35599 states. [2018-12-01 19:17:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35599 states to 35599 states and 107263 transitions. [2018-12-01 19:17:16,650 INFO L78 Accepts]: Start accepts. Automaton has 35599 states and 107263 transitions. Word has length 66 [2018-12-01 19:17:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:16,650 INFO L480 AbstractCegarLoop]: Abstraction has 35599 states and 107263 transitions. [2018-12-01 19:17:16,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:17:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 35599 states and 107263 transitions. [2018-12-01 19:17:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 19:17:16,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:16,659 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] [2018-12-01 19:17:16,659 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:16,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash 615597482, now seen corresponding path program 1 times [2018-12-01 19:17:16,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:16,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:16,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:16,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:16,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:16,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:16,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:17:16,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:17:16,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:17:16,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:16,689 INFO L87 Difference]: Start difference. First operand 35599 states and 107263 transitions. Second operand 5 states. [2018-12-01 19:17:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:16,728 INFO L93 Difference]: Finished difference Result 9283 states and 22466 transitions. [2018-12-01 19:17:16,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:17:16,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-01 19:17:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:16,733 INFO L225 Difference]: With dead ends: 9283 [2018-12-01 19:17:16,733 INFO L226 Difference]: Without dead ends: 7431 [2018-12-01 19:17:16,733 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 [2018-12-01 19:17:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2018-12-01 19:17:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 6328. [2018-12-01 19:17:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-12-01 19:17:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 14937 transitions. [2018-12-01 19:17:16,784 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 14937 transitions. Word has length 66 [2018-12-01 19:17:16,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:16,784 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 14937 transitions. [2018-12-01 19:17:16,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:17:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 14937 transitions. [2018-12-01 19:17:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 19:17:16,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:16,788 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] [2018-12-01 19:17:16,788 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:16,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:16,788 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-01 19:17:16,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:16,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:16,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:16,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:16,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:16,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:16,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:17:16,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:17:16,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:17:16,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:17:16,802 INFO L87 Difference]: Start difference. First operand 6328 states and 14937 transitions. Second operand 3 states. [2018-12-01 19:17:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:16,828 INFO L93 Difference]: Finished difference Result 8755 states and 20596 transitions. [2018-12-01 19:17:16,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:17:16,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-01 19:17:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:16,835 INFO L225 Difference]: With dead ends: 8755 [2018-12-01 19:17:16,835 INFO L226 Difference]: Without dead ends: 8755 [2018-12-01 19:17:16,835 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 [2018-12-01 19:17:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8755 states. [2018-12-01 19:17:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8755 to 6267. [2018-12-01 19:17:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6267 states. [2018-12-01 19:17:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6267 states to 6267 states and 14477 transitions. [2018-12-01 19:17:16,890 INFO L78 Accepts]: Start accepts. Automaton has 6267 states and 14477 transitions. Word has length 66 [2018-12-01 19:17:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:16,891 INFO L480 AbstractCegarLoop]: Abstraction has 6267 states and 14477 transitions. [2018-12-01 19:17:16,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:17:16,891 INFO L276 IsEmpty]: Start isEmpty. Operand 6267 states and 14477 transitions. [2018-12-01 19:17:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-01 19:17:16,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:16,894 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] [2018-12-01 19:17:16,895 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:16,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:16,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-01 19:17:16,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:16,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:16,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:16,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:16,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:17:16,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:17:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:17:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:16,935 INFO L87 Difference]: Start difference. First operand 6267 states and 14477 transitions. Second operand 5 states. [2018-12-01 19:17:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:17,028 INFO L93 Difference]: Finished difference Result 7437 states and 17118 transitions. [2018-12-01 19:17:17,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 19:17:17,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-01 19:17:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:17,032 INFO L225 Difference]: With dead ends: 7437 [2018-12-01 19:17:17,032 INFO L226 Difference]: Without dead ends: 7437 [2018-12-01 19:17:17,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:17:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2018-12-01 19:17:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 6711. [2018-12-01 19:17:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6711 states. [2018-12-01 19:17:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6711 states to 6711 states and 15481 transitions. [2018-12-01 19:17:17,080 INFO L78 Accepts]: Start accepts. Automaton has 6711 states and 15481 transitions. Word has length 72 [2018-12-01 19:17:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:17,080 INFO L480 AbstractCegarLoop]: Abstraction has 6711 states and 15481 transitions. [2018-12-01 19:17:17,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:17:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6711 states and 15481 transitions. [2018-12-01 19:17:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-01 19:17:17,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:17,084 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] [2018-12-01 19:17:17,084 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:17,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-01 19:17:17,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:17,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:17,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:17,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:17,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:17,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:17,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 19:17:17,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 19:17:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 19:17:17,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:17:17,172 INFO L87 Difference]: Start difference. First operand 6711 states and 15481 transitions. Second operand 9 states. [2018-12-01 19:17:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:17,834 INFO L93 Difference]: Finished difference Result 8913 states and 20402 transitions. [2018-12-01 19:17:17,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 19:17:17,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-01 19:17:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:17,845 INFO L225 Difference]: With dead ends: 8913 [2018-12-01 19:17:17,845 INFO L226 Difference]: Without dead ends: 8794 [2018-12-01 19:17:17,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-01 19:17:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8794 states. [2018-12-01 19:17:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8794 to 6808. [2018-12-01 19:17:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6808 states. [2018-12-01 19:17:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6808 states to 6808 states and 15574 transitions. [2018-12-01 19:17:17,912 INFO L78 Accepts]: Start accepts. Automaton has 6808 states and 15574 transitions. Word has length 72 [2018-12-01 19:17:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:17,913 INFO L480 AbstractCegarLoop]: Abstraction has 6808 states and 15574 transitions. [2018-12-01 19:17:17,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 19:17:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 6808 states and 15574 transitions. [2018-12-01 19:17:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 19:17:17,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:17,917 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] [2018-12-01 19:17:17,917 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:17,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1666827177, now seen corresponding path program 1 times [2018-12-01 19:17:17,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:17,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:17,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:17,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:17,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:17:17,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:17:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:17:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:17:17,952 INFO L87 Difference]: Start difference. First operand 6808 states and 15574 transitions. Second operand 4 states. [2018-12-01 19:17:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:18,099 INFO L93 Difference]: Finished difference Result 10575 states and 24061 transitions. [2018-12-01 19:17:18,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:17:18,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-01 19:17:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:18,106 INFO L225 Difference]: With dead ends: 10575 [2018-12-01 19:17:18,106 INFO L226 Difference]: Without dead ends: 10575 [2018-12-01 19:17:18,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:17:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10575 states. [2018-12-01 19:17:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10575 to 7928. [2018-12-01 19:17:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7928 states. [2018-12-01 19:17:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7928 states to 7928 states and 17908 transitions. [2018-12-01 19:17:18,171 INFO L78 Accepts]: Start accepts. Automaton has 7928 states and 17908 transitions. Word has length 91 [2018-12-01 19:17:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:18,171 INFO L480 AbstractCegarLoop]: Abstraction has 7928 states and 17908 transitions. [2018-12-01 19:17:18,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:17:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7928 states and 17908 transitions. [2018-12-01 19:17:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 19:17:18,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:18,177 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] [2018-12-01 19:17:18,178 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:18,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash 496143053, now seen corresponding path program 1 times [2018-12-01 19:17:18,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:18,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:18,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:18,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:18,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:18,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:18,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:17:18,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:17:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:17:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:17:18,214 INFO L87 Difference]: Start difference. First operand 7928 states and 17908 transitions. Second operand 4 states. [2018-12-01 19:17:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:18,270 INFO L93 Difference]: Finished difference Result 8493 states and 19201 transitions. [2018-12-01 19:17:18,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:17:18,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-01 19:17:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:18,275 INFO L225 Difference]: With dead ends: 8493 [2018-12-01 19:17:18,275 INFO L226 Difference]: Without dead ends: 8493 [2018-12-01 19:17:18,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8493 states. [2018-12-01 19:17:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8493 to 7834. [2018-12-01 19:17:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7834 states. [2018-12-01 19:17:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7834 states to 7834 states and 17803 transitions. [2018-12-01 19:17:18,331 INFO L78 Accepts]: Start accepts. Automaton has 7834 states and 17803 transitions. Word has length 91 [2018-12-01 19:17:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:18,332 INFO L480 AbstractCegarLoop]: Abstraction has 7834 states and 17803 transitions. [2018-12-01 19:17:18,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:17:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7834 states and 17803 transitions. [2018-12-01 19:17:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 19:17:18,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:18,338 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] [2018-12-01 19:17:18,338 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:18,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -471503779, now seen corresponding path program 1 times [2018-12-01 19:17:18,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:18,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:18,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:18,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:18,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:18,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:18,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:17:18,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:17:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:17:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:17:18,396 INFO L87 Difference]: Start difference. First operand 7834 states and 17803 transitions. Second operand 7 states. [2018-12-01 19:17:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:18,825 INFO L93 Difference]: Finished difference Result 9672 states and 21911 transitions. [2018-12-01 19:17:18,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:17:18,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 19:17:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:18,831 INFO L225 Difference]: With dead ends: 9672 [2018-12-01 19:17:18,832 INFO L226 Difference]: Without dead ends: 9672 [2018-12-01 19:17:18,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:17:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2018-12-01 19:17:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 7946. [2018-12-01 19:17:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7946 states. [2018-12-01 19:17:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 18123 transitions. [2018-12-01 19:17:18,896 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 18123 transitions. Word has length 93 [2018-12-01 19:17:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:18,896 INFO L480 AbstractCegarLoop]: Abstraction has 7946 states and 18123 transitions. [2018-12-01 19:17:18,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:17:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 18123 transitions. [2018-12-01 19:17:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 19:17:18,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:18,902 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] [2018-12-01 19:17:18,902 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:18,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2034999584, now seen corresponding path program 1 times [2018-12-01 19:17:18,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:18,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:18,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:18,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:18,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:18,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:18,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:17:18,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:17:18,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:17:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:18,969 INFO L87 Difference]: Start difference. First operand 7946 states and 18123 transitions. Second operand 5 states. [2018-12-01 19:17:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:19,044 INFO L93 Difference]: Finished difference Result 8853 states and 20081 transitions. [2018-12-01 19:17:19,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:17:19,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-01 19:17:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:19,050 INFO L225 Difference]: With dead ends: 8853 [2018-12-01 19:17:19,050 INFO L226 Difference]: Without dead ends: 8853 [2018-12-01 19:17:19,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:17:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2018-12-01 19:17:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 6842. [2018-12-01 19:17:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6842 states. [2018-12-01 19:17:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 15642 transitions. [2018-12-01 19:17:19,107 INFO L78 Accepts]: Start accepts. Automaton has 6842 states and 15642 transitions. Word has length 93 [2018-12-01 19:17:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:19,108 INFO L480 AbstractCegarLoop]: Abstraction has 6842 states and 15642 transitions. [2018-12-01 19:17:19,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:17:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 6842 states and 15642 transitions. [2018-12-01 19:17:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 19:17:19,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:19,112 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] [2018-12-01 19:17:19,112 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:19,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2005231167, now seen corresponding path program 1 times [2018-12-01 19:17:19,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:19,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:19,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:17:19,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:17:19,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:17:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:19,152 INFO L87 Difference]: Start difference. First operand 6842 states and 15642 transitions. Second operand 5 states. [2018-12-01 19:17:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:19,389 INFO L93 Difference]: Finished difference Result 11344 states and 26131 transitions. [2018-12-01 19:17:19,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 19:17:19,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-01 19:17:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:19,396 INFO L225 Difference]: With dead ends: 11344 [2018-12-01 19:17:19,396 INFO L226 Difference]: Without dead ends: 11266 [2018-12-01 19:17:19,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:17:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11266 states. [2018-12-01 19:17:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11266 to 7983. [2018-12-01 19:17:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7983 states. [2018-12-01 19:17:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 18289 transitions. [2018-12-01 19:17:19,462 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 18289 transitions. Word has length 93 [2018-12-01 19:17:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:19,463 INFO L480 AbstractCegarLoop]: Abstraction has 7983 states and 18289 transitions. [2018-12-01 19:17:19,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:17:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 18289 transitions. [2018-12-01 19:17:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 19:17:19,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:19,468 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] [2018-12-01 19:17:19,468 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:19,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1044971648, now seen corresponding path program 1 times [2018-12-01 19:17:19,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:19,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:19,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:19,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:19,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:19,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:19,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:17:19,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:17:19,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:17:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:17:19,509 INFO L87 Difference]: Start difference. First operand 7983 states and 18289 transitions. Second operand 6 states. [2018-12-01 19:17:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:19,740 INFO L93 Difference]: Finished difference Result 10118 states and 23011 transitions. [2018-12-01 19:17:19,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 19:17:19,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 19:17:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:19,747 INFO L225 Difference]: With dead ends: 10118 [2018-12-01 19:17:19,747 INFO L226 Difference]: Without dead ends: 10039 [2018-12-01 19:17:19,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:17:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10039 states. [2018-12-01 19:17:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10039 to 7582. [2018-12-01 19:17:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7582 states. [2018-12-01 19:17:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 17399 transitions. [2018-12-01 19:17:19,809 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 17399 transitions. Word has length 93 [2018-12-01 19:17:19,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:19,809 INFO L480 AbstractCegarLoop]: Abstraction has 7582 states and 17399 transitions. [2018-12-01 19:17:19,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:17:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 17399 transitions. [2018-12-01 19:17:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 19:17:19,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:19,814 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] [2018-12-01 19:17:19,814 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:19,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1661415981, now seen corresponding path program 1 times [2018-12-01 19:17:19,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:19,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:19,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:19,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:19,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 19:17:19,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 19:17:19,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 19:17:19,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:17:19,912 INFO L87 Difference]: Start difference. First operand 7582 states and 17399 transitions. Second operand 9 states. [2018-12-01 19:17:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:20,257 INFO L93 Difference]: Finished difference Result 10662 states and 24405 transitions. [2018-12-01 19:17:20,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 19:17:20,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-01 19:17:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:20,263 INFO L225 Difference]: With dead ends: 10662 [2018-12-01 19:17:20,263 INFO L226 Difference]: Without dead ends: 10630 [2018-12-01 19:17:20,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-01 19:17:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2018-12-01 19:17:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 9163. [2018-12-01 19:17:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9163 states. [2018-12-01 19:17:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 20929 transitions. [2018-12-01 19:17:20,333 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 20929 transitions. Word has length 93 [2018-12-01 19:17:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:20,334 INFO L480 AbstractCegarLoop]: Abstraction has 9163 states and 20929 transitions. [2018-12-01 19:17:20,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 19:17:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 20929 transitions. [2018-12-01 19:17:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 19:17:20,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:17:20,340 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:20,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash 836599956, now seen corresponding path program 1 times [2018-12-01 19:17:20,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:20,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:20,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:20,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:20,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 19:17:20,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 19:17:20,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 19:17:20,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:17:20,395 INFO L87 Difference]: Start difference. First operand 9163 states and 20929 transitions. Second operand 8 states. [2018-12-01 19:17:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:20,628 INFO L93 Difference]: Finished difference Result 14219 states and 32893 transitions. [2018-12-01 19:17:20,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 19:17:20,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-01 19:17:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:20,637 INFO L225 Difference]: With dead ends: 14219 [2018-12-01 19:17:20,637 INFO L226 Difference]: Without dead ends: 14219 [2018-12-01 19:17:20,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 19:17:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14219 states. [2018-12-01 19:17:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14219 to 9753. [2018-12-01 19:17:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9753 states. [2018-12-01 19:17:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9753 states to 9753 states and 22460 transitions. [2018-12-01 19:17:20,724 INFO L78 Accepts]: Start accepts. Automaton has 9753 states and 22460 transitions. Word has length 93 [2018-12-01 19:17:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:20,724 INFO L480 AbstractCegarLoop]: Abstraction has 9753 states and 22460 transitions. [2018-12-01 19:17:20,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 19:17:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 9753 states and 22460 transitions. [2018-12-01 19:17:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 19:17:20,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:20,730 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] [2018-12-01 19:17:20,730 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:20,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1724103637, now seen corresponding path program 1 times [2018-12-01 19:17:20,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:20,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:20,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:20,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:20,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:17:20,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:17:20,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:17:20,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:17:20,799 INFO L87 Difference]: Start difference. First operand 9753 states and 22460 transitions. Second operand 7 states. [2018-12-01 19:17:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:20,903 INFO L93 Difference]: Finished difference Result 13588 states and 31510 transitions. [2018-12-01 19:17:20,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:17:20,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 19:17:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:20,913 INFO L225 Difference]: With dead ends: 13588 [2018-12-01 19:17:20,913 INFO L226 Difference]: Without dead ends: 13588 [2018-12-01 19:17:20,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-01 19:17:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13588 states. [2018-12-01 19:17:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13588 to 9833. [2018-12-01 19:17:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9833 states. [2018-12-01 19:17:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9833 states to 9833 states and 22391 transitions. [2018-12-01 19:17:21,000 INFO L78 Accepts]: Start accepts. Automaton has 9833 states and 22391 transitions. Word has length 93 [2018-12-01 19:17:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:21,001 INFO L480 AbstractCegarLoop]: Abstraction has 9833 states and 22391 transitions. [2018-12-01 19:17:21,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:17:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 9833 states and 22391 transitions. [2018-12-01 19:17:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 19:17:21,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:21,008 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] [2018-12-01 19:17:21,008 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:21,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash -7871915, now seen corresponding path program 1 times [2018-12-01 19:17:21,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:21,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:21,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:21,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:21,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:21,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:21,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:17:21,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:17:21,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:17:21,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:17:21,066 INFO L87 Difference]: Start difference. First operand 9833 states and 22391 transitions. Second operand 6 states. [2018-12-01 19:17:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:21,151 INFO L93 Difference]: Finished difference Result 9353 states and 20935 transitions. [2018-12-01 19:17:21,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:17:21,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 19:17:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:21,157 INFO L225 Difference]: With dead ends: 9353 [2018-12-01 19:17:21,157 INFO L226 Difference]: Without dead ends: 9353 [2018-12-01 19:17:21,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:17:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9353 states. [2018-12-01 19:17:21,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9353 to 5822. [2018-12-01 19:17:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-12-01 19:17:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13049 transitions. [2018-12-01 19:17:21,211 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13049 transitions. Word has length 93 [2018-12-01 19:17:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:21,211 INFO L480 AbstractCegarLoop]: Abstraction has 5822 states and 13049 transitions. [2018-12-01 19:17:21,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:17:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13049 transitions. [2018-12-01 19:17:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 19:17:21,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:17:21,215 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:21,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1803035193, now seen corresponding path program 1 times [2018-12-01 19:17:21,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:21,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:21,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:21,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:21,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:21,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:21,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:17:21,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:17:21,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:17:21,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:17:21,274 INFO L87 Difference]: Start difference. First operand 5822 states and 13049 transitions. Second operand 5 states. [2018-12-01 19:17:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:21,300 INFO L93 Difference]: Finished difference Result 5822 states and 13033 transitions. [2018-12-01 19:17:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:17:21,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-01 19:17:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:21,304 INFO L225 Difference]: With dead ends: 5822 [2018-12-01 19:17:21,304 INFO L226 Difference]: Without dead ends: 5822 [2018-12-01 19:17:21,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:17:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5822 states. [2018-12-01 19:17:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5822 to 5822. [2018-12-01 19:17:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-12-01 19:17:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13033 transitions. [2018-12-01 19:17:21,343 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13033 transitions. Word has length 95 [2018-12-01 19:17:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:21,343 INFO L480 AbstractCegarLoop]: Abstraction has 5822 states and 13033 transitions. [2018-12-01 19:17:21,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:17:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13033 transitions. [2018-12-01 19:17:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 19:17:21,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17: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] [2018-12-01 19:17:21,347 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:21,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:21,348 INFO L82 PathProgramCache]: Analyzing trace with hash -915531512, now seen corresponding path program 1 times [2018-12-01 19:17:21,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:21,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:21,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:21,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:21,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 19:17:21,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 19:17:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 19:17:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:17:21,460 INFO L87 Difference]: Start difference. First operand 5822 states and 13033 transitions. Second operand 11 states. [2018-12-01 19:17:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:22,383 INFO L93 Difference]: Finished difference Result 10998 states and 24764 transitions. [2018-12-01 19:17:22,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 19:17:22,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-01 19:17:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:22,391 INFO L225 Difference]: With dead ends: 10998 [2018-12-01 19:17:22,391 INFO L226 Difference]: Without dead ends: 7682 [2018-12-01 19:17:22,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-01 19:17:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2018-12-01 19:17:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 5708. [2018-12-01 19:17:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5708 states. [2018-12-01 19:17:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 12720 transitions. [2018-12-01 19:17:22,454 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 12720 transitions. Word has length 95 [2018-12-01 19:17:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:22,454 INFO L480 AbstractCegarLoop]: Abstraction has 5708 states and 12720 transitions. [2018-12-01 19:17:22,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 19:17:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 12720 transitions. [2018-12-01 19:17:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 19:17:22,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:22,457 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] [2018-12-01 19:17:22,457 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:22,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2034339057, now seen corresponding path program 1 times [2018-12-01 19:17:22,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:22,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:22,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:22,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:22,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:22,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:22,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:17:22,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:17:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:17:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:17:22,525 INFO L87 Difference]: Start difference. First operand 5708 states and 12720 transitions. Second operand 6 states. [2018-12-01 19:17:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:22,607 INFO L93 Difference]: Finished difference Result 6462 states and 14232 transitions. [2018-12-01 19:17:22,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:17:22,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-01 19:17:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:22,611 INFO L225 Difference]: With dead ends: 6462 [2018-12-01 19:17:22,611 INFO L226 Difference]: Without dead ends: 6432 [2018-12-01 19:17:22,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:17:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2018-12-01 19:17:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 5653. [2018-12-01 19:17:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2018-12-01 19:17:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 12502 transitions. [2018-12-01 19:17:22,650 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 12502 transitions. Word has length 95 [2018-12-01 19:17:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:22,651 INFO L480 AbstractCegarLoop]: Abstraction has 5653 states and 12502 transitions. [2018-12-01 19:17:22,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:17:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 12502 transitions. [2018-12-01 19:17:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 19:17:22,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:22,654 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] [2018-12-01 19:17:22,654 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:22,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1697868305, now seen corresponding path program 2 times [2018-12-01 19:17:22,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:22,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:22,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:17:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:17:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:17:22,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:17:22,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:17:22,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:17:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:17:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:17:22,697 INFO L87 Difference]: Start difference. First operand 5653 states and 12502 transitions. Second operand 6 states. [2018-12-01 19:17:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:17:22,801 INFO L93 Difference]: Finished difference Result 6090 states and 13395 transitions. [2018-12-01 19:17:22,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:17:22,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-01 19:17:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:17:22,805 INFO L225 Difference]: With dead ends: 6090 [2018-12-01 19:17:22,805 INFO L226 Difference]: Without dead ends: 6090 [2018-12-01 19:17:22,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:17:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2018-12-01 19:17:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 5579. [2018-12-01 19:17:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5579 states. [2018-12-01 19:17:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 12324 transitions. [2018-12-01 19:17:22,843 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 12324 transitions. Word has length 95 [2018-12-01 19:17:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:17:22,844 INFO L480 AbstractCegarLoop]: Abstraction has 5579 states and 12324 transitions. [2018-12-01 19:17:22,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:17:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 12324 transitions. [2018-12-01 19:17:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 19:17:22,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:17:22,847 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] [2018-12-01 19:17:22,847 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:17:22,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:17:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1930862478, now seen corresponding path program 2 times [2018-12-01 19:17:22,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:17:22,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:17:22,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:22,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:17:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:17:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:17:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:17:22,893 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 19:17:22,972 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 19:17:22,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 07:17:22 BasicIcfg [2018-12-01 19:17:22,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 19:17:22,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:17:22,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:17:22,974 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:17:22,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:17:06" (3/4) ... [2018-12-01 19:17:22,976 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 19:17:23,043 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_665723d7-de6d-4629-a5e8-a86332883089/bin-2019/uautomizer/witness.graphml [2018-12-01 19:17:23,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 19:17:23,044 INFO L168 Benchmark]: Toolchain (without parser) took 17381.35 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 950.6 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 485.9 MB. Max. memory is 11.5 GB. [2018-12-01 19:17:23,045 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:17:23,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-01 19:17:23,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:17:23,046 INFO L168 Benchmark]: Boogie Preprocessor took 17.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:17:23,046 INFO L168 Benchmark]: RCFGBuilder took 332.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-12-01 19:17:23,046 INFO L168 Benchmark]: TraceAbstraction took 16546.65 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 396.0 MB. Max. memory is 11.5 GB. [2018-12-01 19:17:23,046 INFO L168 Benchmark]: Witness Printer took 69.36 ms. Allocated memory is still 2.6 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2018-12-01 19:17:23,048 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 332.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16546.65 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 396.0 MB. Max. memory is 11.5 GB. * Witness Printer took 69.36 ms. Allocated memory is still 2.6 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1553; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L772] -1 pthread_t t1554; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 16.4s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8461 SDtfs, 9386 SDslu, 19599 SDs, 0 SdLazy, 8854 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 84 SyntacticMatches, 31 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35599occurred in iteration=14, 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: 4.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 84819 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2479 NumberOfCodeBlocks, 2479 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2352 ConstructedInterpolants, 0 QuantifiedInterpolants, 525251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...