./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/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 b5ac5ac0524d373e5b17171bec59d9141c5ffe2e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 13:17:37,023 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:17:37,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:17:37,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:17:37,034 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:17:37,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:17:37,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:17:37,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:17:37,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:17:37,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:17:37,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:17:37,041 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:17:37,042 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:17:37,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:17:37,043 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:17:37,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:17:37,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:17:37,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:17:37,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:17:37,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:17:37,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:17:37,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:17:37,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:17:37,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:17:37,054 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:17:37,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:17:37,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:17:37,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:17:37,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:17:37,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:17:37,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:17:37,058 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:17:37,058 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:17:37,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:17:37,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:17:37,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:17:37,059 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:17:37,070 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:17:37,070 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:17:37,070 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:17:37,071 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:17:37,071 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:17:37,071 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:17:37,071 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:17:37,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:17:37,072 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:17:37,073 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:17:37,073 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:17:37,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:17:37,073 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:17:37,073 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:17:37,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:17:37,073 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:17:37,073 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:17:37,074 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:17:37,074 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:17:37,074 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:17:37,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:17:37,074 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_d91922ee-cd90-4ccb-84c9-85b9c6b94528/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 -> b5ac5ac0524d373e5b17171bec59d9141c5ffe2e [2018-11-28 13:17:37,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:17:37,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:17:37,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:17:37,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:17:37,109 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:17:37,109 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_false-unreach-call.i [2018-11-28 13:17:37,150 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/data/9d4894828/34965bcbed95467988960f8a25d61f21/FLAG7529c9e3b [2018-11-28 13:17:37,520 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:17:37,520 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/sv-benchmarks/c/pthread-wmm/mix045_power.opt_false-unreach-call.i [2018-11-28 13:17:37,532 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/data/9d4894828/34965bcbed95467988960f8a25d61f21/FLAG7529c9e3b [2018-11-28 13:17:37,908 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/data/9d4894828/34965bcbed95467988960f8a25d61f21 [2018-11-28 13:17:37,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:17:37,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:17:37,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:37,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:17:37,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:17:37,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:37" (1/1) ... [2018-11-28 13:17:37,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1437d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:37, skipping insertion in model container [2018-11-28 13:17:37,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:37" (1/1) ... [2018-11-28 13:17:37,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:17:37,953 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:17:38,186 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:38,195 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:17:38,279 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:38,322 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:17:38,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38 WrapperNode [2018-11-28 13:17:38,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:38,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:38,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:17:38,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:17:38,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... [2018-11-28 13:17:38,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... [2018-11-28 13:17:38,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:38,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:17:38,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:17:38,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:17:38,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... [2018-11-28 13:17:38,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... [2018-11-28 13:17:38,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... [2018-11-28 13:17:38,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... [2018-11-28 13:17:38,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... [2018-11-28 13:17:38,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... [2018-11-28 13:17:38,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... [2018-11-28 13:17:38,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:17:38,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:17:38,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:17:38,384 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:17:38,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/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-11-28 13:17:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:17:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:17:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 13:17:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:17:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 13:17:38,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 13:17:38,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 13:17:38,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 13:17:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 13:17:38,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 13:17:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 13:17:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:17:38,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:17:38,421 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 13:17:38,888 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:17:38,888 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:17:38,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:38 BoogieIcfgContainer [2018-11-28 13:17:38,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:17:38,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:17:38,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:17:38,891 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:17:38,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:17:37" (1/3) ... [2018-11-28 13:17:38,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b7e196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:17:38, skipping insertion in model container [2018-11-28 13:17:38,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:38" (2/3) ... [2018-11-28 13:17:38,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b7e196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:17:38, skipping insertion in model container [2018-11-28 13:17:38,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:38" (3/3) ... [2018-11-28 13:17:38,893 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_false-unreach-call.i [2018-11-28 13:17:38,917 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,917 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,918 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,918 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,918 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,918 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,918 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,919 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,919 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,919 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,919 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,920 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,927 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,927 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,927 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,928 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,928 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,928 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:17:38,942 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:17:38,942 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:17:38,949 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 13:17:38,961 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 13:17:38,981 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:17:38,981 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:17:38,982 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:17:38,982 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:17:38,982 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:17:38,982 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:17:38,982 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:17:38,982 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:17:38,982 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:17:38,992 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-11-28 13:17:57,139 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-11-28 13:17:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-11-28 13:17:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:17:57,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:57,150 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-11-28 13:17:57,152 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:57,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-11-28 13:17:57,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:57,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:57,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:57,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:57,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:57,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:57,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:57,362 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-11-28 13:18:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:01,764 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-11-28 13:18:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:18:01,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 13:18:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:02,589 INFO L225 Difference]: With dead ends: 233474 [2018-11-28 13:18:02,589 INFO L226 Difference]: Without dead ends: 203724 [2018-11-28 13:18:02,590 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-11-28 13:18:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-11-28 13:18:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-11-28 13:18:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-11-28 13:18:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-11-28 13:18:06,942 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-11-28 13:18:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:06,943 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-11-28 13:18:06,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:18:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-11-28 13:18:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:18:06,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:06,953 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-11-28 13:18:06,954 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:06,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:06,954 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-11-28 13:18:06,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:06,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:06,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:06,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:06,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:07,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:07,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:18:07,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:18:07,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:18:07,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:18:07,029 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-11-28 13:18:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:07,813 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-11-28 13:18:07,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:18:07,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 13:18:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:09,084 INFO L225 Difference]: With dead ends: 118894 [2018-11-28 13:18:09,084 INFO L226 Difference]: Without dead ends: 118894 [2018-11-28 13:18:09,085 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-11-28 13:18:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-11-28 13:18:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-11-28 13:18:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-11-28 13:18:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-11-28 13:18:16,126 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-11-28 13:18:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:16,127 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-11-28 13:18:16,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:18:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-11-28 13:18:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:18:16,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:16,131 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-11-28 13:18:16,131 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:16,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:16,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-11-28 13:18:16,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:16,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:16,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:16,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:16,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:16,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:16,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:18:16,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:18:16,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:18:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:18:16,216 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-11-28 13:18:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:18,148 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-11-28 13:18:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:18:18,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-28 13:18:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:19,088 INFO L225 Difference]: With dead ends: 325274 [2018-11-28 13:18:19,088 INFO L226 Difference]: Without dead ends: 324274 [2018-11-28 13:18:19,088 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-11-28 13:18:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-11-28 13:18:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-11-28 13:18:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-11-28 13:18:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-11-28 13:18:26,313 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-11-28 13:18:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:26,313 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-11-28 13:18:26,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:18:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-11-28 13:18:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:18:26,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:26,322 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] [2018-11-28 13:18:26,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:26,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:26,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-11-28 13:18:26,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:26,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:26,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:26,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:26,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:26,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:26,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:18:26,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:18:26,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:18:26,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:18:26,393 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 4 states. [2018-11-28 13:18:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:27,181 INFO L93 Difference]: Finished difference Result 163600 states and 725474 transitions. [2018-11-28 13:18:27,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:18:27,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-11-28 13:18:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:27,622 INFO L225 Difference]: With dead ends: 163600 [2018-11-28 13:18:27,622 INFO L226 Difference]: Without dead ends: 160995 [2018-11-28 13:18:27,622 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-11-28 13:18:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2018-11-28 13:18:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2018-11-28 13:18:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2018-11-28 13:18:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 716802 transitions. [2018-11-28 13:18:35,353 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 716802 transitions. Word has length 53 [2018-11-28 13:18:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:35,354 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 716802 transitions. [2018-11-28 13:18:35,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:18:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 716802 transitions. [2018-11-28 13:18:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:18:35,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:35,361 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] [2018-11-28 13:18:35,361 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:35,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:35,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1135621285, now seen corresponding path program 1 times [2018-11-28 13:18:35,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:35,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:35,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:35,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:35,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:18:35,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:18:35,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:18:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:18:35,429 INFO L87 Difference]: Start difference. First operand 160995 states and 716802 transitions. Second operand 3 states. [2018-11-28 13:18:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:36,183 INFO L93 Difference]: Finished difference Result 160995 states and 716766 transitions. [2018-11-28 13:18:36,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:18:36,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-28 13:18:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:37,388 INFO L225 Difference]: With dead ends: 160995 [2018-11-28 13:18:37,388 INFO L226 Difference]: Without dead ends: 160995 [2018-11-28 13:18:37,389 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-11-28 13:18:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2018-11-28 13:18:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2018-11-28 13:18:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2018-11-28 13:18:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 716766 transitions. [2018-11-28 13:18:41,414 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 716766 transitions. Word has length 54 [2018-11-28 13:18:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:41,414 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 716766 transitions. [2018-11-28 13:18:41,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:18:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 716766 transitions. [2018-11-28 13:18:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:18:41,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:41,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:18:41,419 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:41,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:41,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1416535676, now seen corresponding path program 1 times [2018-11-28 13:18:41,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:41,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:41,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:41,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:41,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:41,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:18:41,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:18:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:18:41,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:18:41,483 INFO L87 Difference]: Start difference. First operand 160995 states and 716766 transitions. Second operand 5 states. [2018-11-28 13:18:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:46,753 INFO L93 Difference]: Finished difference Result 289851 states and 1285659 transitions. [2018-11-28 13:18:46,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:18:46,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-28 13:18:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:47,581 INFO L225 Difference]: With dead ends: 289851 [2018-11-28 13:18:47,581 INFO L226 Difference]: Without dead ends: 289011 [2018-11-28 13:18:47,581 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-11-28 13:18:49,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289011 states. [2018-11-28 13:18:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289011 to 169615. [2018-11-28 13:18:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169615 states. [2018-11-28 13:18:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169615 states to 169615 states and 752619 transitions. [2018-11-28 13:18:52,981 INFO L78 Accepts]: Start accepts. Automaton has 169615 states and 752619 transitions. Word has length 54 [2018-11-28 13:18:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:52,982 INFO L480 AbstractCegarLoop]: Abstraction has 169615 states and 752619 transitions. [2018-11-28 13:18:52,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:18:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 169615 states and 752619 transitions. [2018-11-28 13:18:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 13:18:53,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:53,004 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] [2018-11-28 13:18:53,004 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:53,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:53,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1663856536, now seen corresponding path program 1 times [2018-11-28 13:18:53,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:53,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:53,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:53,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:53,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:53,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:53,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:18:53,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:18:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:18:53,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:18:53,073 INFO L87 Difference]: Start difference. First operand 169615 states and 752619 transitions. Second operand 5 states. [2018-11-28 13:18:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:53,357 INFO L93 Difference]: Finished difference Result 59119 states and 239395 transitions. [2018-11-28 13:18:53,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:18:53,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-28 13:18:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:53,481 INFO L225 Difference]: With dead ends: 59119 [2018-11-28 13:18:53,481 INFO L226 Difference]: Without dead ends: 56807 [2018-11-28 13:18:53,481 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-11-28 13:18:53,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56807 states. [2018-11-28 13:18:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56807 to 56807. [2018-11-28 13:18:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56807 states. [2018-11-28 13:18:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56807 states to 56807 states and 230741 transitions. [2018-11-28 13:18:55,133 INFO L78 Accepts]: Start accepts. Automaton has 56807 states and 230741 transitions. Word has length 61 [2018-11-28 13:18:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:55,133 INFO L480 AbstractCegarLoop]: Abstraction has 56807 states and 230741 transitions. [2018-11-28 13:18:55,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:18:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 56807 states and 230741 transitions. [2018-11-28 13:18:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 13:18:55,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:55,143 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] [2018-11-28 13:18:55,143 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:55,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash -106888934, now seen corresponding path program 1 times [2018-11-28 13:18:55,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:55,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:55,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:55,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:55,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:55,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:18:55,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:18:55,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:18:55,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:18:55,230 INFO L87 Difference]: Start difference. First operand 56807 states and 230741 transitions. Second operand 4 states. [2018-11-28 13:18:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:55,706 INFO L93 Difference]: Finished difference Result 78971 states and 316066 transitions. [2018-11-28 13:18:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:18:55,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 13:18:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:55,876 INFO L225 Difference]: With dead ends: 78971 [2018-11-28 13:18:55,877 INFO L226 Difference]: Without dead ends: 78971 [2018-11-28 13:18:55,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:18:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78971 states. [2018-11-28 13:18:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78971 to 61563. [2018-11-28 13:18:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61563 states. [2018-11-28 13:18:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61563 states to 61563 states and 248434 transitions. [2018-11-28 13:18:57,002 INFO L78 Accepts]: Start accepts. Automaton has 61563 states and 248434 transitions. Word has length 67 [2018-11-28 13:18:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:57,002 INFO L480 AbstractCegarLoop]: Abstraction has 61563 states and 248434 transitions. [2018-11-28 13:18:57,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:18:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 61563 states and 248434 transitions. [2018-11-28 13:18:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 13:18:57,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:57,016 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] [2018-11-28 13:18:57,016 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:57,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1635921401, now seen corresponding path program 1 times [2018-11-28 13:18:57,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:57,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:57,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:57,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:57,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:57,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:18:57,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:18:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:18:57,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:18:57,083 INFO L87 Difference]: Start difference. First operand 61563 states and 248434 transitions. Second operand 4 states. [2018-11-28 13:18:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:58,267 INFO L93 Difference]: Finished difference Result 85638 states and 341484 transitions. [2018-11-28 13:18:58,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:18:58,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 13:18:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:58,444 INFO L225 Difference]: With dead ends: 85638 [2018-11-28 13:18:58,444 INFO L226 Difference]: Without dead ends: 85638 [2018-11-28 13:18:58,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:18:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85638 states. [2018-11-28 13:18:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85638 to 77175. [2018-11-28 13:18:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77175 states. [2018-11-28 13:18:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77175 states to 77175 states and 309663 transitions. [2018-11-28 13:18:59,761 INFO L78 Accepts]: Start accepts. Automaton has 77175 states and 309663 transitions. Word has length 67 [2018-11-28 13:18:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:59,761 INFO L480 AbstractCegarLoop]: Abstraction has 77175 states and 309663 transitions. [2018-11-28 13:18:59,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:18:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 77175 states and 309663 transitions. [2018-11-28 13:18:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 13:18:59,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:59,777 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] [2018-11-28 13:18:59,777 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:59,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1847272314, now seen corresponding path program 1 times [2018-11-28 13:18:59,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:59,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:59,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:59,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:59,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:59,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:59,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:18:59,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:18:59,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:18:59,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:18:59,839 INFO L87 Difference]: Start difference. First operand 77175 states and 309663 transitions. Second operand 6 states. [2018-11-28 13:18:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:59,914 INFO L93 Difference]: Finished difference Result 13799 states and 46903 transitions. [2018-11-28 13:18:59,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:18:59,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 13:18:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:59,932 INFO L225 Difference]: With dead ends: 13799 [2018-11-28 13:18:59,932 INFO L226 Difference]: Without dead ends: 11707 [2018-11-28 13:18:59,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:18:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11707 states. [2018-11-28 13:19:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11707 to 11172. [2018-11-28 13:19:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11172 states. [2018-11-28 13:19:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11172 states to 11172 states and 37928 transitions. [2018-11-28 13:19:00,068 INFO L78 Accepts]: Start accepts. Automaton has 11172 states and 37928 transitions. Word has length 67 [2018-11-28 13:19:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:00,068 INFO L480 AbstractCegarLoop]: Abstraction has 11172 states and 37928 transitions. [2018-11-28 13:19:00,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:19:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 11172 states and 37928 transitions. [2018-11-28 13:19:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 13:19:00,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:00,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:00,083 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:00,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2144628424, now seen corresponding path program 1 times [2018-11-28 13:19:00,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:00,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:00,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:00,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:00,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:00,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:00,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:00,165 INFO L87 Difference]: Start difference. First operand 11172 states and 37928 transitions. Second operand 5 states. [2018-11-28 13:19:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:00,380 INFO L93 Difference]: Finished difference Result 13057 states and 43741 transitions. [2018-11-28 13:19:00,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:19:00,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-11-28 13:19:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:00,453 INFO L225 Difference]: With dead ends: 13057 [2018-11-28 13:19:00,454 INFO L226 Difference]: Without dead ends: 13057 [2018-11-28 13:19:00,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2018-11-28 13:19:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 11582. [2018-11-28 13:19:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11582 states. [2018-11-28 13:19:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11582 states to 11582 states and 39291 transitions. [2018-11-28 13:19:00,595 INFO L78 Accepts]: Start accepts. Automaton has 11582 states and 39291 transitions. Word has length 100 [2018-11-28 13:19:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:00,595 INFO L480 AbstractCegarLoop]: Abstraction has 11582 states and 39291 transitions. [2018-11-28 13:19:00,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 11582 states and 39291 transitions. [2018-11-28 13:19:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 13:19:00,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:00,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:00,610 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:00,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1838316113, now seen corresponding path program 1 times [2018-11-28 13:19:00,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:00,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:00,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:00,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:00,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:19:00,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:19:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:19:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:19:00,681 INFO L87 Difference]: Start difference. First operand 11582 states and 39291 transitions. Second operand 4 states. [2018-11-28 13:19:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:00,804 INFO L93 Difference]: Finished difference Result 14177 states and 47302 transitions. [2018-11-28 13:19:00,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:19:00,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-28 13:19:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:00,825 INFO L225 Difference]: With dead ends: 14177 [2018-11-28 13:19:00,825 INFO L226 Difference]: Without dead ends: 14037 [2018-11-28 13:19:00,825 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-11-28 13:19:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2018-11-28 13:19:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 12312. [2018-11-28 13:19:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12312 states. [2018-11-28 13:19:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12312 states to 12312 states and 41505 transitions. [2018-11-28 13:19:00,989 INFO L78 Accepts]: Start accepts. Automaton has 12312 states and 41505 transitions. Word has length 100 [2018-11-28 13:19:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:00,989 INFO L480 AbstractCegarLoop]: Abstraction has 12312 states and 41505 transitions. [2018-11-28 13:19:00,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:19:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 12312 states and 41505 transitions. [2018-11-28 13:19:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 13:19:01,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:01,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:01,003 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:01,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:01,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1487070160, now seen corresponding path program 1 times [2018-11-28 13:19:01,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:01,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:01,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:01,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:01,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:01,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:19:01,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:19:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:19:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:19:01,050 INFO L87 Difference]: Start difference. First operand 12312 states and 41505 transitions. Second operand 4 states. [2018-11-28 13:19:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:01,236 INFO L93 Difference]: Finished difference Result 16072 states and 54251 transitions. [2018-11-28 13:19:01,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:19:01,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-28 13:19:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:01,258 INFO L225 Difference]: With dead ends: 16072 [2018-11-28 13:19:01,259 INFO L226 Difference]: Without dead ends: 16072 [2018-11-28 13:19:01,259 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-11-28 13:19:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16072 states. [2018-11-28 13:19:01,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16072 to 11657. [2018-11-28 13:19:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11657 states. [2018-11-28 13:19:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 39026 transitions. [2018-11-28 13:19:01,421 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 39026 transitions. Word has length 100 [2018-11-28 13:19:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:01,421 INFO L480 AbstractCegarLoop]: Abstraction has 11657 states and 39026 transitions. [2018-11-28 13:19:01,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:19:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 39026 transitions. [2018-11-28 13:19:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 13:19:01,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:01,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:01,435 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:01,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2072054210, now seen corresponding path program 2 times [2018-11-28 13:19:01,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:01,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:01,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:01,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:01,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:01,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:01,507 INFO L87 Difference]: Start difference. First operand 11657 states and 39026 transitions. Second operand 5 states. [2018-11-28 13:19:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:01,694 INFO L93 Difference]: Finished difference Result 13377 states and 44322 transitions. [2018-11-28 13:19:01,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:19:01,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-11-28 13:19:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:01,713 INFO L225 Difference]: With dead ends: 13377 [2018-11-28 13:19:01,713 INFO L226 Difference]: Without dead ends: 13237 [2018-11-28 13:19:01,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-11-28 13:19:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13237 states. [2018-11-28 13:19:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13237 to 11227. [2018-11-28 13:19:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11227 states. [2018-11-28 13:19:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11227 states to 11227 states and 37602 transitions. [2018-11-28 13:19:01,855 INFO L78 Accepts]: Start accepts. Automaton has 11227 states and 37602 transitions. Word has length 100 [2018-11-28 13:19:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:01,856 INFO L480 AbstractCegarLoop]: Abstraction has 11227 states and 37602 transitions. [2018-11-28 13:19:01,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 11227 states and 37602 transitions. [2018-11-28 13:19:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 13:19:01,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:01,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:01,869 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:01,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:01,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1807291188, now seen corresponding path program 1 times [2018-11-28 13:19:01,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:01,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:01,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:19:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:01,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:01,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:19:01,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:19:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:19:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:19:01,942 INFO L87 Difference]: Start difference. First operand 11227 states and 37602 transitions. Second operand 6 states. [2018-11-28 13:19:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:02,320 INFO L93 Difference]: Finished difference Result 12897 states and 42353 transitions. [2018-11-28 13:19:02,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:19:02,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-28 13:19:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:02,339 INFO L225 Difference]: With dead ends: 12897 [2018-11-28 13:19:02,339 INFO L226 Difference]: Without dead ends: 12522 [2018-11-28 13:19:02,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-28 13:19:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12522 states. [2018-11-28 13:19:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12522 to 12072. [2018-11-28 13:19:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12072 states. [2018-11-28 13:19:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12072 states to 12072 states and 40043 transitions. [2018-11-28 13:19:02,480 INFO L78 Accepts]: Start accepts. Automaton has 12072 states and 40043 transitions. Word has length 102 [2018-11-28 13:19:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:02,480 INFO L480 AbstractCegarLoop]: Abstraction has 12072 states and 40043 transitions. [2018-11-28 13:19:02,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:19:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 12072 states and 40043 transitions. [2018-11-28 13:19:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 13:19:02,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:02,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:02,497 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:02,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash -786935629, now seen corresponding path program 1 times [2018-11-28 13:19:02,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:02,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:02,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:02,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:02,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:02,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:02,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:02,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:02,614 INFO L87 Difference]: Start difference. First operand 12072 states and 40043 transitions. Second operand 7 states. [2018-11-28 13:19:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:02,889 INFO L93 Difference]: Finished difference Result 13315 states and 44013 transitions. [2018-11-28 13:19:02,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:19:02,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-11-28 13:19:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:02,907 INFO L225 Difference]: With dead ends: 13315 [2018-11-28 13:19:02,907 INFO L226 Difference]: Without dead ends: 13315 [2018-11-28 13:19:02,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13315 states. [2018-11-28 13:19:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13315 to 12047. [2018-11-28 13:19:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12047 states. [2018-11-28 13:19:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12047 states to 12047 states and 39998 transitions. [2018-11-28 13:19:03,054 INFO L78 Accepts]: Start accepts. Automaton has 12047 states and 39998 transitions. Word has length 102 [2018-11-28 13:19:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:03,054 INFO L480 AbstractCegarLoop]: Abstraction has 12047 states and 39998 transitions. [2018-11-28 13:19:03,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 12047 states and 39998 transitions. [2018-11-28 13:19:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 13:19:03,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:03,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:03,067 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:03,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash 623943891, now seen corresponding path program 1 times [2018-11-28 13:19:03,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:03,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:03,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:03,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:03,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:03,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:03,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:03,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:03,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:03,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:03,167 INFO L87 Difference]: Start difference. First operand 12047 states and 39998 transitions. Second operand 5 states. [2018-11-28 13:19:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:03,286 INFO L93 Difference]: Finished difference Result 10230 states and 33766 transitions. [2018-11-28 13:19:03,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:19:03,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-28 13:19:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:03,300 INFO L225 Difference]: With dead ends: 10230 [2018-11-28 13:19:03,300 INFO L226 Difference]: Without dead ends: 10230 [2018-11-28 13:19:03,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:19:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10230 states. [2018-11-28 13:19:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10230 to 9760. [2018-11-28 13:19:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9760 states. [2018-11-28 13:19:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9760 states to 9760 states and 32415 transitions. [2018-11-28 13:19:03,417 INFO L78 Accepts]: Start accepts. Automaton has 9760 states and 32415 transitions. Word has length 102 [2018-11-28 13:19:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:03,417 INFO L480 AbstractCegarLoop]: Abstraction has 9760 states and 32415 transitions. [2018-11-28 13:19:03,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 9760 states and 32415 transitions. [2018-11-28 13:19:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 13:19:03,428 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:03,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:03,428 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:03,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:03,428 INFO L82 PathProgramCache]: Analyzing trace with hash 175247252, now seen corresponding path program 1 times [2018-11-28 13:19:03,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:03,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:03,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:03,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:03,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:03,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:19:03,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:19:03,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:19:03,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:19:03,559 INFO L87 Difference]: Start difference. First operand 9760 states and 32415 transitions. Second operand 6 states. [2018-11-28 13:19:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:03,783 INFO L93 Difference]: Finished difference Result 8608 states and 27967 transitions. [2018-11-28 13:19:03,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:19:03,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-28 13:19:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:03,795 INFO L225 Difference]: With dead ends: 8608 [2018-11-28 13:19:03,795 INFO L226 Difference]: Without dead ends: 8608 [2018-11-28 13:19:03,795 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-11-28 13:19:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2018-11-28 13:19:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 7183. [2018-11-28 13:19:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7183 states. [2018-11-28 13:19:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 23561 transitions. [2018-11-28 13:19:03,924 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 23561 transitions. Word has length 102 [2018-11-28 13:19:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:03,924 INFO L480 AbstractCegarLoop]: Abstraction has 7183 states and 23561 transitions. [2018-11-28 13:19:03,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:19:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 23561 transitions. [2018-11-28 13:19:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:19:03,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:03,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:03,932 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:03,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -427821553, now seen corresponding path program 1 times [2018-11-28 13:19:03,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:03,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:03,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:03,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:03,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:03,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:03,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:03,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:03,997 INFO L87 Difference]: Start difference. First operand 7183 states and 23561 transitions. Second operand 7 states. [2018-11-28 13:19:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:04,376 INFO L93 Difference]: Finished difference Result 13310 states and 43019 transitions. [2018-11-28 13:19:04,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:19:04,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-28 13:19:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:04,393 INFO L225 Difference]: With dead ends: 13310 [2018-11-28 13:19:04,393 INFO L226 Difference]: Without dead ends: 13310 [2018-11-28 13:19:04,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:19:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2018-11-28 13:19:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 10245. [2018-11-28 13:19:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10245 states. [2018-11-28 13:19:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 33633 transitions. [2018-11-28 13:19:04,530 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 33633 transitions. Word has length 104 [2018-11-28 13:19:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:04,531 INFO L480 AbstractCegarLoop]: Abstraction has 10245 states and 33633 transitions. [2018-11-28 13:19:04,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 33633 transitions. [2018-11-28 13:19:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:19:04,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:04,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:04,541 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:04,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:04,542 INFO L82 PathProgramCache]: Analyzing trace with hash 816942928, now seen corresponding path program 1 times [2018-11-28 13:19:04,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:04,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:04,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:04,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:04,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:04,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:04,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:19:04,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:19:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:19:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:19:04,625 INFO L87 Difference]: Start difference. First operand 10245 states and 33633 transitions. Second operand 6 states. [2018-11-28 13:19:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:04,728 INFO L93 Difference]: Finished difference Result 10435 states and 33930 transitions. [2018-11-28 13:19:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:04,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-28 13:19:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:04,741 INFO L225 Difference]: With dead ends: 10435 [2018-11-28 13:19:04,742 INFO L226 Difference]: Without dead ends: 10435 [2018-11-28 13:19:04,742 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-11-28 13:19:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10435 states. [2018-11-28 13:19:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10435 to 10170. [2018-11-28 13:19:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10170 states. [2018-11-28 13:19:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 33203 transitions. [2018-11-28 13:19:04,861 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 33203 transitions. Word has length 104 [2018-11-28 13:19:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:04,861 INFO L480 AbstractCegarLoop]: Abstraction has 10170 states and 33203 transitions. [2018-11-28 13:19:04,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:19:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 33203 transitions. [2018-11-28 13:19:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:19:04,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:04,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:04,872 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:04,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash -98055792, now seen corresponding path program 1 times [2018-11-28 13:19:04,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:04,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:04,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:04,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:04,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:04,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:04,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:04,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:04,967 INFO L87 Difference]: Start difference. First operand 10170 states and 33203 transitions. Second operand 5 states. [2018-11-28 13:19:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:05,044 INFO L93 Difference]: Finished difference Result 15086 states and 50171 transitions. [2018-11-28 13:19:05,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:19:05,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-28 13:19:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:05,065 INFO L225 Difference]: With dead ends: 15086 [2018-11-28 13:19:05,065 INFO L226 Difference]: Without dead ends: 15086 [2018-11-28 13:19:05,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:19:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15086 states. [2018-11-28 13:19:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15086 to 8820. [2018-11-28 13:19:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8820 states. [2018-11-28 13:19:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8820 states to 8820 states and 28663 transitions. [2018-11-28 13:19:05,200 INFO L78 Accepts]: Start accepts. Automaton has 8820 states and 28663 transitions. Word has length 104 [2018-11-28 13:19:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:05,200 INFO L480 AbstractCegarLoop]: Abstraction has 8820 states and 28663 transitions. [2018-11-28 13:19:05,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8820 states and 28663 transitions. [2018-11-28 13:19:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:19:05,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:05,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:05,209 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:05,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:05,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2023589103, now seen corresponding path program 1 times [2018-11-28 13:19:05,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:05,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:05,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:05,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:05,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:05,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:05,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:05,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:05,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:05,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:05,283 INFO L87 Difference]: Start difference. First operand 8820 states and 28663 transitions. Second operand 5 states. [2018-11-28 13:19:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:05,464 INFO L93 Difference]: Finished difference Result 10100 states and 32823 transitions. [2018-11-28 13:19:05,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:19:05,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-28 13:19:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:05,478 INFO L225 Difference]: With dead ends: 10100 [2018-11-28 13:19:05,478 INFO L226 Difference]: Without dead ends: 10100 [2018-11-28 13:19:05,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10100 states. [2018-11-28 13:19:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10100 to 9012. [2018-11-28 13:19:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9012 states. [2018-11-28 13:19:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9012 states to 9012 states and 29287 transitions. [2018-11-28 13:19:05,609 INFO L78 Accepts]: Start accepts. Automaton has 9012 states and 29287 transitions. Word has length 104 [2018-11-28 13:19:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:05,609 INFO L480 AbstractCegarLoop]: Abstraction has 9012 states and 29287 transitions. [2018-11-28 13:19:05,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 9012 states and 29287 transitions. [2018-11-28 13:19:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:19:05,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:05,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:05,618 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:05,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:05,619 INFO L82 PathProgramCache]: Analyzing trace with hash -778824622, now seen corresponding path program 1 times [2018-11-28 13:19:05,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:05,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:05,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:05,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:05,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:05,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:05,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:19:05,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:19:05,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:19:05,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:19:05,866 INFO L87 Difference]: Start difference. First operand 9012 states and 29287 transitions. Second operand 10 states. [2018-11-28 13:19:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:06,454 INFO L93 Difference]: Finished difference Result 16888 states and 55330 transitions. [2018-11-28 13:19:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:06,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-11-28 13:19:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:06,466 INFO L225 Difference]: With dead ends: 16888 [2018-11-28 13:19:06,466 INFO L226 Difference]: Without dead ends: 8288 [2018-11-28 13:19:06,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:19:06,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8288 states. [2018-11-28 13:19:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8288 to 8288. [2018-11-28 13:19:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8288 states. [2018-11-28 13:19:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8288 states to 8288 states and 27183 transitions. [2018-11-28 13:19:06,565 INFO L78 Accepts]: Start accepts. Automaton has 8288 states and 27183 transitions. Word has length 104 [2018-11-28 13:19:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:06,566 INFO L480 AbstractCegarLoop]: Abstraction has 8288 states and 27183 transitions. [2018-11-28 13:19:06,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:19:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 8288 states and 27183 transitions. [2018-11-28 13:19:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:19:06,575 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:06,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:06,575 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:06,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1989616522, now seen corresponding path program 2 times [2018-11-28 13:19:06,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:06,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:06,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:06,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:06,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:06,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:06,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:06,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:06,657 INFO L87 Difference]: Start difference. First operand 8288 states and 27183 transitions. Second operand 7 states. [2018-11-28 13:19:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:06,869 INFO L93 Difference]: Finished difference Result 15238 states and 50752 transitions. [2018-11-28 13:19:06,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:19:06,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-28 13:19:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:06,879 INFO L225 Difference]: With dead ends: 15238 [2018-11-28 13:19:06,880 INFO L226 Difference]: Without dead ends: 7183 [2018-11-28 13:19:06,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:19:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2018-11-28 13:19:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 7183. [2018-11-28 13:19:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7183 states. [2018-11-28 13:19:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 24179 transitions. [2018-11-28 13:19:06,964 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 24179 transitions. Word has length 104 [2018-11-28 13:19:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:06,964 INFO L480 AbstractCegarLoop]: Abstraction has 7183 states and 24179 transitions. [2018-11-28 13:19:06,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 24179 transitions. [2018-11-28 13:19:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:19:06,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:06,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:06,971 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:06,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:06,972 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2018-11-28 13:19:06,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:06,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:06,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:19:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:07,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:07,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:19:07,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:19:07,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:19:07,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:19:07,062 INFO L87 Difference]: Start difference. First operand 7183 states and 24179 transitions. Second operand 6 states. [2018-11-28 13:19:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:07,196 INFO L93 Difference]: Finished difference Result 7423 states and 24775 transitions. [2018-11-28 13:19:07,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:19:07,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-28 13:19:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:07,207 INFO L225 Difference]: With dead ends: 7423 [2018-11-28 13:19:07,207 INFO L226 Difference]: Without dead ends: 7343 [2018-11-28 13:19:07,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:19:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2018-11-28 13:19:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 7151. [2018-11-28 13:19:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2018-11-28 13:19:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 24075 transitions. [2018-11-28 13:19:07,291 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 24075 transitions. Word has length 104 [2018-11-28 13:19:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:07,291 INFO L480 AbstractCegarLoop]: Abstraction has 7151 states and 24075 transitions. [2018-11-28 13:19:07,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:19:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 24075 transitions. [2018-11-28 13:19:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:19:07,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:07,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:07,298 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:07,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2018-11-28 13:19:07,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:07,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:07,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:07,375 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:19:07,497 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:19:07,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:19:07 BasicIcfg [2018-11-28 13:19:07,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:19:07,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:19:07,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:19:07,499 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:19:07,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:38" (3/4) ... [2018-11-28 13:19:07,502 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:19:07,626 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d91922ee-cd90-4ccb-84c9-85b9c6b94528/bin-2019/uautomizer/witness.graphml [2018-11-28 13:19:07,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:19:07,627 INFO L168 Benchmark]: Toolchain (without parser) took 89717.27 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.3 GB). Free memory was 954.9 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-11-28 13:19:07,628 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:19:07,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:07,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:07,632 INFO L168 Benchmark]: Boogie Preprocessor took 21.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:07,632 INFO L168 Benchmark]: RCFGBuilder took 504.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:07,632 INFO L168 Benchmark]: TraceAbstraction took 88609.54 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-11-28 13:19:07,633 INFO L168 Benchmark]: Witness Printer took 127.89 ms. Allocated memory is still 7.3 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:07,634 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 504.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88609.54 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 127.89 ms. Allocated memory is still 7.3 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L786] -1 pthread_t t1198; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L787] FCALL, FORK -1 pthread_create(&t1198, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L788] -1 pthread_t t1199; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L789] FCALL, FORK -1 pthread_create(&t1199, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L790] -1 pthread_t t1200; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L791] FCALL, FORK -1 pthread_create(&t1200, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, 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, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, 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, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, 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, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 88.5s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5781 SDtfs, 5789 SDslu, 11008 SDs, 0 SdLazy, 3989 SolverSat, 275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 69 SyntacticMatches, 13 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186424occurred in iteration=3, 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: 41.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 392596 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2212 NumberOfCodeBlocks, 2212 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2083 ConstructedInterpolants, 0 QuantifiedInterpolants, 440552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...