./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/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 47e0e2e2f593a1c2b5c24aa2d193465263bbddc3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 19:13:19,159 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:13:19,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:13:19,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:13:19,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:13:19,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:13:19,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:13:19,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:13:19,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:13:19,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:13:19,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:13:19,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:13:19,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:13:19,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:13:19,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:13:19,176 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:13:19,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:13:19,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:13:19,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:13:19,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:13:19,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:13:19,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:13:19,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:13:19,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:13:19,184 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:13:19,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:13:19,185 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:13:19,186 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:13:19,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:13:19,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:13:19,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:13:19,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:13:19,187 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:13:19,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:13:19,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:13:19,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:13:19,188 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 19:13:19,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:13:19,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:13:19,196 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 19:13:19,196 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 19:13:19,196 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:13:19,196 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:13:19,196 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:13:19,197 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:13:19,197 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:13:19,197 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:13:19,197 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:13:19,197 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:13:19,198 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 19:13:19,198 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 19:13:19,198 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 19:13:19,198 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:13:19,198 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:13:19,198 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:13:19,198 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 19:13:19,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:13:19,199 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:13:19,199 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 19:13:19,199 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 19:13:19,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 19:13:19,199 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:13:19,200 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 19:13:19,200 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 19:13:19,200 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 19:13:19,200 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 19:13:19,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 19:13:19,200 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_88a36edb-9d88-4938-b925-bd675f70fbe5/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 -> 47e0e2e2f593a1c2b5c24aa2d193465263bbddc3 [2018-12-01 19:13:19,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:13:19,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:13:19,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:13:19,228 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:13:19,228 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:13:19,228 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i [2018-12-01 19:13:19,264 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/data/9db041c4b/bea8543d94ab403a970d872bb04057e2/FLAG5298ca000 [2018-12-01 19:13:19,675 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:13:19,675 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i [2018-12-01 19:13:19,683 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/data/9db041c4b/bea8543d94ab403a970d872bb04057e2/FLAG5298ca000 [2018-12-01 19:13:19,691 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/data/9db041c4b/bea8543d94ab403a970d872bb04057e2 [2018-12-01 19:13:19,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:13:19,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:13:19,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:13:19,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:13:19,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:13:19,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:13:19" (1/1) ... [2018-12-01 19:13:19,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:19, skipping insertion in model container [2018-12-01 19:13:19,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:13:19" (1/1) ... [2018-12-01 19:13:19,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:13:19,725 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:13:19,903 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:13:19,911 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:13:19,985 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:13:20,014 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:13:20,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20 WrapperNode [2018-12-01 19:13:20,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:13:20,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:13:20,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:13:20,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:13:20,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... [2018-12-01 19:13:20,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... [2018-12-01 19:13:20,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:13:20,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:13:20,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:13:20,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:13:20,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... [2018-12-01 19:13:20,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... [2018-12-01 19:13:20,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... [2018-12-01 19:13:20,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... [2018-12-01 19:13:20,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... [2018-12-01 19:13:20,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... [2018-12-01 19:13:20,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... [2018-12-01 19:13:20,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:13:20,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:13:20,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:13:20,067 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:13:20,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 19:13:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 19:13:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 19:13:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 19:13:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 19:13:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 19:13:20,103 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 19:13:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 19:13:20,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 19:13:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 19:13:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:13:20,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:13:20,105 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 19:13:20,397 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:13:20,397 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 19:13:20,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:13:20 BoogieIcfgContainer [2018-12-01 19:13:20,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:13:20,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 19:13:20,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 19:13:20,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 19:13:20,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 07:13:19" (1/3) ... [2018-12-01 19:13:20,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654c0bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:13:20, skipping insertion in model container [2018-12-01 19:13:20,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:13:20" (2/3) ... [2018-12-01 19:13:20,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654c0bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:13:20, skipping insertion in model container [2018-12-01 19:13:20,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:13:20" (3/3) ... [2018-12-01 19:13:20,402 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.oepc_false-unreach-call.i [2018-12-01 19:13:20,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,425 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,425 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,425 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,425 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,425 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,429 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:13:20,443 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 19:13:20,443 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 19:13:20,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 19:13:20,458 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 19:13:20,473 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:13:20,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 19:13:20,473 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 19:13:20,473 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 19:13:20,473 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:13:20,473 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:13:20,473 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 19:13:20,474 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:13:20,474 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 19:13:20,480 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-01 19:13:22,175 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-01 19:13:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-01 19:13:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 19:13:22,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:22,181 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] [2018-12-01 19:13:22,183 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:22,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash 314479455, now seen corresponding path program 1 times [2018-12-01 19:13:22,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:22,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:22,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:22,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:22,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:22,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:13:22,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:13:22,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:13:22,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:22,343 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-01 19:13:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:22,831 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-01 19:13:22,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:13:22,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-01 19:13:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:22,983 INFO L225 Difference]: With dead ends: 60791 [2018-12-01 19:13:22,983 INFO L226 Difference]: Without dead ends: 44271 [2018-12-01 19:13:22,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-01 19:13:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-01 19:13:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-01 19:13:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-01 19:13:23,815 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-01 19:13:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:23,815 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-01 19:13:23,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:13:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-01 19:13:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 19:13:23,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:23,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:13:23,820 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:23,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:23,820 INFO L82 PathProgramCache]: Analyzing trace with hash -494436635, now seen corresponding path program 1 times [2018-12-01 19:13:23,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:23,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:23,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:23,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:23,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:23,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:23,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:13:23,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:13:23,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:13:23,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:13:23,861 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 3 states. [2018-12-01 19:13:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:24,057 INFO L93 Difference]: Finished difference Result 27339 states and 105223 transitions. [2018-12-01 19:13:24,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:13:24,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-01 19:13:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:24,149 INFO L225 Difference]: With dead ends: 27339 [2018-12-01 19:13:24,149 INFO L226 Difference]: Without dead ends: 27339 [2018-12-01 19:13:24,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:13:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-12-01 19:13:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27339. [2018-12-01 19:13:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-01 19:13:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105223 transitions. [2018-12-01 19:13:24,698 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105223 transitions. Word has length 46 [2018-12-01 19:13:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:24,699 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105223 transitions. [2018-12-01 19:13:24,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:13:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105223 transitions. [2018-12-01 19:13:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 19:13:24,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:24,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:13:24,701 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:24,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:24,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1248373700, now seen corresponding path program 1 times [2018-12-01 19:13:24,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:24,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:24,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:24,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:24,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:24,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:24,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:13:24,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:13:24,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:13:24,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:24,743 INFO L87 Difference]: Start difference. First operand 27339 states and 105223 transitions. Second operand 5 states. [2018-12-01 19:13:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:25,234 INFO L93 Difference]: Finished difference Result 64005 states and 235022 transitions. [2018-12-01 19:13:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:13:25,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-01 19:13:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:25,353 INFO L225 Difference]: With dead ends: 64005 [2018-12-01 19:13:25,353 INFO L226 Difference]: Without dead ends: 63453 [2018-12-01 19:13:25,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:13:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-01 19:13:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-01 19:13:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-01 19:13:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152053 transitions. [2018-12-01 19:13:26,248 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152053 transitions. Word has length 46 [2018-12-01 19:13:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:26,248 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152053 transitions. [2018-12-01 19:13:26,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:13:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152053 transitions. [2018-12-01 19:13:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-01 19:13:26,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:26,251 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] [2018-12-01 19:13:26,251 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:26,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1026875031, now seen corresponding path program 1 times [2018-12-01 19:13:26,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:26,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:26,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:26,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:26,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:26,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:13:26,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:13:26,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:13:26,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:26,331 INFO L87 Difference]: Start difference. First operand 41421 states and 152053 transitions. Second operand 5 states. [2018-12-01 19:13:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:26,889 INFO L93 Difference]: Finished difference Result 81367 states and 297636 transitions. [2018-12-01 19:13:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:13:26,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-01 19:13:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:27,034 INFO L225 Difference]: With dead ends: 81367 [2018-12-01 19:13:27,034 INFO L226 Difference]: Without dead ends: 80855 [2018-12-01 19:13:27,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:13:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-01 19:13:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-01 19:13:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-01 19:13:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 165678 transitions. [2018-12-01 19:13:27,873 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 165678 transitions. Word has length 47 [2018-12-01 19:13:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:27,873 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 165678 transitions. [2018-12-01 19:13:27,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:13:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 165678 transitions. [2018-12-01 19:13:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-01 19:13:27,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:27,879 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] [2018-12-01 19:13:27,879 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:27,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash -43389411, now seen corresponding path program 1 times [2018-12-01 19:13:27,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:27,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:27,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:27,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:27,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:27,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:27,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:13:27,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:13:27,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:13:27,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:13:27,910 INFO L87 Difference]: Start difference. First operand 45375 states and 165678 transitions. Second operand 3 states. [2018-12-01 19:13:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:28,140 INFO L93 Difference]: Finished difference Result 65251 states and 235338 transitions. [2018-12-01 19:13:28,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:13:28,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-01 19:13:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:28,257 INFO L225 Difference]: With dead ends: 65251 [2018-12-01 19:13:28,257 INFO L226 Difference]: Without dead ends: 65251 [2018-12-01 19:13:28,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:13:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-01 19:13:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-01 19:13:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-01 19:13:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 183963 transitions. [2018-12-01 19:13:29,164 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 183963 transitions. Word has length 49 [2018-12-01 19:13:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:29,164 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 183963 transitions. [2018-12-01 19:13:29,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:13:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 183963 transitions. [2018-12-01 19:13:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 19:13:29,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:29,174 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-12-01 19:13:29,174 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:29,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash -860096332, now seen corresponding path program 1 times [2018-12-01 19:13:29,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:29,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:29,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:29,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:29,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:29,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:29,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:13:29,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:13:29,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:13:29,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:13:29,258 INFO L87 Difference]: Start difference. First operand 50945 states and 183963 transitions. Second operand 6 states. [2018-12-01 19:13:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:29,773 INFO L93 Difference]: Finished difference Result 67511 states and 241920 transitions. [2018-12-01 19:13:29,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:13:29,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-01 19:13:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:29,893 INFO L225 Difference]: With dead ends: 67511 [2018-12-01 19:13:29,893 INFO L226 Difference]: Without dead ends: 67511 [2018-12-01 19:13:29,894 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-12-01 19:13:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-01 19:13:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-01 19:13:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-01 19:13:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227319 transitions. [2018-12-01 19:13:30,907 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227319 transitions. Word has length 53 [2018-12-01 19:13:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:30,907 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227319 transitions. [2018-12-01 19:13:30,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:13:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227319 transitions. [2018-12-01 19:13:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 19:13:30,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:30,915 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-12-01 19:13:30,916 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:30,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:30,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1637919605, now seen corresponding path program 1 times [2018-12-01 19:13:30,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:30,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:30,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:30,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:30,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:13:30,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:13:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:13:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:30,980 INFO L87 Difference]: Start difference. First operand 63436 states and 227319 transitions. Second operand 7 states. [2018-12-01 19:13:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:31,846 INFO L93 Difference]: Finished difference Result 88528 states and 305936 transitions. [2018-12-01 19:13:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 19:13:31,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-01 19:13:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:31,998 INFO L225 Difference]: With dead ends: 88528 [2018-12-01 19:13:31,998 INFO L226 Difference]: Without dead ends: 88528 [2018-12-01 19:13:31,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-01 19:13:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-01 19:13:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-01 19:13:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-01 19:13:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262722 transitions. [2018-12-01 19:13:33,281 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262722 transitions. Word has length 53 [2018-12-01 19:13:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:33,282 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262722 transitions. [2018-12-01 19:13:33,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:13:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262722 transitions. [2018-12-01 19:13:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 19:13:33,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:33,291 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-12-01 19:13:33,291 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:33,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1769544010, now seen corresponding path program 1 times [2018-12-01 19:13:33,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:33,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:33,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:33,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:33,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:13:33,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:13:33,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:13:33,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:33,326 INFO L87 Difference]: Start difference. First operand 74881 states and 262722 transitions. Second operand 4 states. [2018-12-01 19:13:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:33,392 INFO L93 Difference]: Finished difference Result 15375 states and 48802 transitions. [2018-12-01 19:13:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:13:33,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-01 19:13:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:33,410 INFO L225 Difference]: With dead ends: 15375 [2018-12-01 19:13:33,410 INFO L226 Difference]: Without dead ends: 13789 [2018-12-01 19:13:33,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-01 19:13:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-01 19:13:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-01 19:13:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43328 transitions. [2018-12-01 19:13:33,549 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43328 transitions. Word has length 53 [2018-12-01 19:13:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:33,550 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43328 transitions. [2018-12-01 19:13:33,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:13:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43328 transitions. [2018-12-01 19:13:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 19:13:33,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:33,551 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-12-01 19:13:33,551 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:33,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:33,551 INFO L82 PathProgramCache]: Analyzing trace with hash -431668952, now seen corresponding path program 1 times [2018-12-01 19:13:33,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:33,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:33,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:33,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:33,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:13:33,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:13:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:13:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:13:33,612 INFO L87 Difference]: Start difference. First operand 13740 states and 43328 transitions. Second operand 6 states. [2018-12-01 19:13:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:33,866 INFO L93 Difference]: Finished difference Result 19970 states and 62557 transitions. [2018-12-01 19:13:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 19:13:33,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-01 19:13:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:33,889 INFO L225 Difference]: With dead ends: 19970 [2018-12-01 19:13:33,889 INFO L226 Difference]: Without dead ends: 19898 [2018-12-01 19:13:33,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-01 19:13:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-01 19:13:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-01 19:13:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-01 19:13:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45025 transitions. [2018-12-01 19:13:34,058 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45025 transitions. Word has length 53 [2018-12-01 19:13:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:34,059 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45025 transitions. [2018-12-01 19:13:34,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:13:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45025 transitions. [2018-12-01 19:13:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-01 19:13:34,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:34,062 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-12-01 19:13:34,063 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:34,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash -488484476, now seen corresponding path program 1 times [2018-12-01 19:13:34,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:34,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:34,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:34,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:34,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:13:34,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:13:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:13:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:34,087 INFO L87 Difference]: Start difference. First operand 14314 states and 45025 transitions. Second operand 4 states. [2018-12-01 19:13:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:34,183 INFO L93 Difference]: Finished difference Result 16617 states and 52353 transitions. [2018-12-01 19:13:34,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:13:34,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-01 19:13:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:34,202 INFO L225 Difference]: With dead ends: 16617 [2018-12-01 19:13:34,202 INFO L226 Difference]: Without dead ends: 16617 [2018-12-01 19:13:34,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-01 19:13:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-01 19:13:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-01 19:13:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47615 transitions. [2018-12-01 19:13:34,361 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47615 transitions. Word has length 61 [2018-12-01 19:13:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:34,362 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47615 transitions. [2018-12-01 19:13:34,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:13:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47615 transitions. [2018-12-01 19:13:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-01 19:13:34,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:34,364 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-12-01 19:13:34,365 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:34,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1254325859, now seen corresponding path program 1 times [2018-12-01 19:13:34,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:34,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:34,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:34,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:34,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:13:34,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:13:34,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:13:34,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:13:34,416 INFO L87 Difference]: Start difference. First operand 15134 states and 47615 transitions. Second operand 6 states. [2018-12-01 19:13:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:34,701 INFO L93 Difference]: Finished difference Result 28106 states and 88091 transitions. [2018-12-01 19:13:34,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 19:13:34,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-01 19:13:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:34,736 INFO L225 Difference]: With dead ends: 28106 [2018-12-01 19:13:34,736 INFO L226 Difference]: Without dead ends: 28035 [2018-12-01 19:13:34,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:13:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-01 19:13:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-01 19:13:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-01 19:13:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54277 transitions. [2018-12-01 19:13:34,965 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54277 transitions. Word has length 61 [2018-12-01 19:13:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:34,966 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54277 transitions. [2018-12-01 19:13:34,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:13:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54277 transitions. [2018-12-01 19:13:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 19:13:34,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:34,970 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] [2018-12-01 19:13:34,970 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:34,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash -779265337, now seen corresponding path program 1 times [2018-12-01 19:13:34,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:34,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:34,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:34,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:34,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:13:34,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:13:34,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:13:34,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:13:34,996 INFO L87 Difference]: Start difference. First operand 17412 states and 54277 transitions. Second operand 3 states. [2018-12-01 19:13:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:35,126 INFO L93 Difference]: Finished difference Result 18092 states and 56109 transitions. [2018-12-01 19:13:35,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:13:35,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-01 19:13:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:35,173 INFO L225 Difference]: With dead ends: 18092 [2018-12-01 19:13:35,173 INFO L226 Difference]: Without dead ends: 18092 [2018-12-01 19:13:35,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:13:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-01 19:13:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-01 19:13:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-01 19:13:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55193 transitions. [2018-12-01 19:13:35,334 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55193 transitions. Word has length 65 [2018-12-01 19:13:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:35,334 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55193 transitions. [2018-12-01 19:13:35,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:13:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55193 transitions. [2018-12-01 19:13:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 19:13:35,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:35,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:13:35,338 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:35,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1651397062, now seen corresponding path program 1 times [2018-12-01 19:13:35,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:35,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:35,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:35,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:35,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:35,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:35,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:13:35,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:13:35,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:13:35,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:35,365 INFO L87 Difference]: Start difference. First operand 17752 states and 55193 transitions. Second operand 4 states. [2018-12-01 19:13:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:35,541 INFO L93 Difference]: Finished difference Result 21696 states and 66682 transitions. [2018-12-01 19:13:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:13:35,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-01 19:13:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:35,565 INFO L225 Difference]: With dead ends: 21696 [2018-12-01 19:13:35,565 INFO L226 Difference]: Without dead ends: 21696 [2018-12-01 19:13:35,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-01 19:13:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-01 19:13:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-01 19:13:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60572 transitions. [2018-12-01 19:13:35,774 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60572 transitions. Word has length 65 [2018-12-01 19:13:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:35,775 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60572 transitions. [2018-12-01 19:13:35,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:13:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60572 transitions. [2018-12-01 19:13:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 19:13:35,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:35,781 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-12-01 19:13:35,781 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:35,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1637753329, now seen corresponding path program 1 times [2018-12-01 19:13:35,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:35,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:35,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:35,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:35,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:13:35,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:13:35,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:13:35,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:13:35,823 INFO L87 Difference]: Start difference. First operand 19646 states and 60572 transitions. Second operand 6 states. [2018-12-01 19:13:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:36,349 INFO L93 Difference]: Finished difference Result 23814 states and 72270 transitions. [2018-12-01 19:13:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:13:36,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-01 19:13:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:36,375 INFO L225 Difference]: With dead ends: 23814 [2018-12-01 19:13:36,375 INFO L226 Difference]: Without dead ends: 23814 [2018-12-01 19:13:36,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-01 19:13:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-01 19:13:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-01 19:13:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68700 transitions. [2018-12-01 19:13:36,613 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68700 transitions. Word has length 67 [2018-12-01 19:13:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:36,613 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68700 transitions. [2018-12-01 19:13:36,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:13:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68700 transitions. [2018-12-01 19:13:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 19:13:36,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:36,620 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-12-01 19:13:36,620 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:36,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash 580004624, now seen corresponding path program 1 times [2018-12-01 19:13:36,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:36,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:36,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:36,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:36,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:36,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:36,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:13:36,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:13:36,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:13:36,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:13:36,690 INFO L87 Difference]: Start difference. First operand 22474 states and 68700 transitions. Second operand 6 states. [2018-12-01 19:13:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:36,965 INFO L93 Difference]: Finished difference Result 25702 states and 76160 transitions. [2018-12-01 19:13:36,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 19:13:36,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-01 19:13:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:36,995 INFO L225 Difference]: With dead ends: 25702 [2018-12-01 19:13:36,995 INFO L226 Difference]: Without dead ends: 25702 [2018-12-01 19:13:36,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:13:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-01 19:13:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-01 19:13:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-01 19:13:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68806 transitions. [2018-12-01 19:13:37,232 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68806 transitions. Word has length 67 [2018-12-01 19:13:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:37,232 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68806 transitions. [2018-12-01 19:13:37,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:13:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68806 transitions. [2018-12-01 19:13:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 19:13:37,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:37,239 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-12-01 19:13:37,239 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:37,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:37,239 INFO L82 PathProgramCache]: Analyzing trace with hash 791355537, now seen corresponding path program 1 times [2018-12-01 19:13:37,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:37,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:37,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:37,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:37,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:37,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:37,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:13:37,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:13:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:13:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:37,287 INFO L87 Difference]: Start difference. First operand 22858 states and 68806 transitions. Second operand 5 states. [2018-12-01 19:13:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:37,510 INFO L93 Difference]: Finished difference Result 29793 states and 89371 transitions. [2018-12-01 19:13:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:13:37,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-01 19:13:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:37,544 INFO L225 Difference]: With dead ends: 29793 [2018-12-01 19:13:37,544 INFO L226 Difference]: Without dead ends: 29793 [2018-12-01 19:13:37,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:37,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-01 19:13:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-01 19:13:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-01 19:13:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80315 transitions. [2018-12-01 19:13:37,839 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80315 transitions. Word has length 67 [2018-12-01 19:13:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:37,839 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80315 transitions. [2018-12-01 19:13:37,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:13:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80315 transitions. [2018-12-01 19:13:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 19:13:37,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:37,848 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-12-01 19:13:37,848 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:37,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash 280821360, now seen corresponding path program 1 times [2018-12-01 19:13:37,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:37,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:37,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:37,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:37,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:13:37,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:13:37,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:13:37,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:37,889 INFO L87 Difference]: Start difference. First operand 26814 states and 80315 transitions. Second operand 5 states. [2018-12-01 19:13:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:38,214 INFO L93 Difference]: Finished difference Result 36420 states and 108385 transitions. [2018-12-01 19:13:38,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:13:38,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-01 19:13:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:38,253 INFO L225 Difference]: With dead ends: 36420 [2018-12-01 19:13:38,253 INFO L226 Difference]: Without dead ends: 36420 [2018-12-01 19:13:38,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:13:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-01 19:13:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-01 19:13:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-01 19:13:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87791 transitions. [2018-12-01 19:13:38,601 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87791 transitions. Word has length 67 [2018-12-01 19:13:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:38,601 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87791 transitions. [2018-12-01 19:13:38,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:13:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87791 transitions. [2018-12-01 19:13:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 19:13:38,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:38,608 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-12-01 19:13:38,608 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:38,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:38,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1526633103, now seen corresponding path program 1 times [2018-12-01 19:13:38,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:38,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:38,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:38,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:38,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:38,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:38,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:13:38,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:13:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:13:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:38,642 INFO L87 Difference]: Start difference. First operand 29428 states and 87791 transitions. Second operand 4 states. [2018-12-01 19:13:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:39,078 INFO L93 Difference]: Finished difference Result 38892 states and 116477 transitions. [2018-12-01 19:13:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:13:39,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-01 19:13:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:39,124 INFO L225 Difference]: With dead ends: 38892 [2018-12-01 19:13:39,124 INFO L226 Difference]: Without dead ends: 38660 [2018-12-01 19:13:39,124 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-12-01 19:13:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38660 states. [2018-12-01 19:13:39,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38660 to 35784. [2018-12-01 19:13:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2018-12-01 19:13:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 107258 transitions. [2018-12-01 19:13:39,511 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 107258 transitions. Word has length 67 [2018-12-01 19:13:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:39,512 INFO L480 AbstractCegarLoop]: Abstraction has 35784 states and 107258 transitions. [2018-12-01 19:13:39,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:13:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 107258 transitions. [2018-12-01 19:13:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 19:13:39,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:39,519 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-12-01 19:13:39,519 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:39,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 971382834, now seen corresponding path program 1 times [2018-12-01 19:13:39,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:39,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:39,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:39,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:39,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:39,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:39,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:13:39,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:13:39,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:13:39,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:39,555 INFO L87 Difference]: Start difference. First operand 35784 states and 107258 transitions. Second operand 5 states. [2018-12-01 19:13:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:39,597 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-12-01 19:13:39,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:13:39,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-01 19:13:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:39,602 INFO L225 Difference]: With dead ends: 9316 [2018-12-01 19:13:39,603 INFO L226 Difference]: Without dead ends: 7464 [2018-12-01 19:13:39,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:39,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-12-01 19:13:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-12-01 19:13:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-12-01 19:13:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-12-01 19:13:39,651 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-12-01 19:13:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:39,651 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-12-01 19:13:39,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:13:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-12-01 19:13:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 19:13:39,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:39,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:13:39,655 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:39,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:39,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1144549580, now seen corresponding path program 1 times [2018-12-01 19:13:39,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:39,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:39,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:39,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:39,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:13:39,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:13:39,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:13:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:13:39,668 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-12-01 19:13:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:39,698 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-12-01 19:13:39,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:13:39,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-01 19:13:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:39,704 INFO L225 Difference]: With dead ends: 8820 [2018-12-01 19:13:39,704 INFO L226 Difference]: Without dead ends: 8820 [2018-12-01 19:13:39,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:13:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-12-01 19:13:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-12-01 19:13:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-12-01 19:13:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-12-01 19:13:39,754 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-12-01 19:13:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:39,754 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-12-01 19:13:39,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:13:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-12-01 19:13:39,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-01 19:13:39,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:39,758 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] [2018-12-01 19:13:39,758 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:39,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:39,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1467487719, now seen corresponding path program 1 times [2018-12-01 19:13:39,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:39,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:39,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:39,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:39,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:13:39,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:13:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:13:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:39,795 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-12-01 19:13:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:39,890 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-12-01 19:13:39,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 19:13:39,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-01 19:13:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:39,895 INFO L225 Difference]: With dead ends: 7470 [2018-12-01 19:13:39,895 INFO L226 Difference]: Without dead ends: 7470 [2018-12-01 19:13:39,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:13:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-01 19:13:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-12-01 19:13:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-12-01 19:13:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-12-01 19:13:39,942 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-12-01 19:13:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:39,943 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-12-01 19:13:39,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:13:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-12-01 19:13:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-01 19:13:39,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:39,947 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] [2018-12-01 19:13:39,947 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:39,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:39,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1084669242, now seen corresponding path program 1 times [2018-12-01 19:13:39,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:39,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:39,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:39,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:39,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:13:39,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:13:39,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:13:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:39,981 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-12-01 19:13:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:40,230 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-12-01 19:13:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 19:13:40,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-01 19:13:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:40,235 INFO L225 Difference]: With dead ends: 7881 [2018-12-01 19:13:40,235 INFO L226 Difference]: Without dead ends: 7762 [2018-12-01 19:13:40,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-01 19:13:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-12-01 19:13:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-12-01 19:13:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-01 19:13:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-12-01 19:13:40,285 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-12-01 19:13:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:40,285 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-12-01 19:13:40,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:13:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-12-01 19:13:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-01 19:13:40,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:40,290 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] [2018-12-01 19:13:40,290 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:40,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:40,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1588401736, now seen corresponding path program 1 times [2018-12-01 19:13:40,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:40,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:40,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:40,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:40,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:40,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:40,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:13:40,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:13:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:13:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:40,326 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-12-01 19:13:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:40,493 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-12-01 19:13:40,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:13:40,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-01 19:13:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:40,501 INFO L225 Difference]: With dead ends: 10608 [2018-12-01 19:13:40,501 INFO L226 Difference]: Without dead ends: 10608 [2018-12-01 19:13:40,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-12-01 19:13:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-12-01 19:13:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-12-01 19:13:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-12-01 19:13:40,567 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-12-01 19:13:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:40,567 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-12-01 19:13:40,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:13:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-12-01 19:13:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-01 19:13:40,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:40,573 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] [2018-12-01 19:13:40,573 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:40,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash -627466390, now seen corresponding path program 2 times [2018-12-01 19:13:40,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:40,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:40,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:13:40,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:13:40,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:13:40,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:13:40,599 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-12-01 19:13:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:40,675 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-12-01 19:13:40,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:13:40,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-01 19:13:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:40,681 INFO L225 Difference]: With dead ends: 8526 [2018-12-01 19:13:40,681 INFO L226 Difference]: Without dead ends: 8526 [2018-12-01 19:13:40,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-01 19:13:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-12-01 19:13:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-01 19:13:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-12-01 19:13:40,741 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-12-01 19:13:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:40,742 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-12-01 19:13:40,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:13:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-12-01 19:13:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-01 19:13:40,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:40,747 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] [2018-12-01 19:13:40,747 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:40,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash 402565006, now seen corresponding path program 1 times [2018-12-01 19:13:40,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:40,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:40,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:40,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:13:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:40,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:40,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:13:40,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:13:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:13:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:40,801 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 7 states. [2018-12-01 19:13:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:41,216 INFO L93 Difference]: Finished difference Result 9705 states and 21992 transitions. [2018-12-01 19:13:41,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:13:41,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-01 19:13:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:41,223 INFO L225 Difference]: With dead ends: 9705 [2018-12-01 19:13:41,223 INFO L226 Difference]: Without dead ends: 9705 [2018-12-01 19:13:41,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2018-12-01 19:13:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 7979. [2018-12-01 19:13:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7979 states. [2018-12-01 19:13:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 18204 transitions. [2018-12-01 19:13:41,285 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 18204 transitions. Word has length 94 [2018-12-01 19:13:41,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:41,285 INFO L480 AbstractCegarLoop]: Abstraction has 7979 states and 18204 transitions. [2018-12-01 19:13:41,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:13:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 18204 transitions. [2018-12-01 19:13:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-01 19:13:41,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:41,291 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] [2018-12-01 19:13:41,291 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:41,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash -431677389, now seen corresponding path program 1 times [2018-12-01 19:13:41,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:41,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:41,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:41,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:13:41,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:13:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:13:41,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:41,342 INFO L87 Difference]: Start difference. First operand 7979 states and 18204 transitions. Second operand 5 states. [2018-12-01 19:13:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:41,402 INFO L93 Difference]: Finished difference Result 8886 states and 20162 transitions. [2018-12-01 19:13:41,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:13:41,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-01 19:13:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:41,408 INFO L225 Difference]: With dead ends: 8886 [2018-12-01 19:13:41,408 INFO L226 Difference]: Without dead ends: 8886 [2018-12-01 19:13:41,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2018-12-01 19:13:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 6875. [2018-12-01 19:13:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2018-12-01 19:13:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 15723 transitions. [2018-12-01 19:13:41,460 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 15723 transitions. Word has length 94 [2018-12-01 19:13:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:41,460 INFO L480 AbstractCegarLoop]: Abstraction has 6875 states and 15723 transitions. [2018-12-01 19:13:41,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:13:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 15723 transitions. [2018-12-01 19:13:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-01 19:13:41,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:41,464 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] [2018-12-01 19:13:41,464 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:41,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:41,464 INFO L82 PathProgramCache]: Analyzing trace with hash -686413934, now seen corresponding path program 1 times [2018-12-01 19:13:41,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:41,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:41,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:41,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:41,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:41,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:41,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:13:41,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:13:41,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:13:41,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:13:41,503 INFO L87 Difference]: Start difference. First operand 6875 states and 15723 transitions. Second operand 5 states. [2018-12-01 19:13:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:41,669 INFO L93 Difference]: Finished difference Result 8123 states and 18363 transitions. [2018-12-01 19:13:41,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:13:41,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-01 19:13:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:41,675 INFO L225 Difference]: With dead ends: 8123 [2018-12-01 19:13:41,675 INFO L226 Difference]: Without dead ends: 7992 [2018-12-01 19:13:41,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2018-12-01 19:13:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7614. [2018-12-01 19:13:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2018-12-01 19:13:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 17342 transitions. [2018-12-01 19:13:41,728 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 17342 transitions. Word has length 94 [2018-12-01 19:13:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:41,728 INFO L480 AbstractCegarLoop]: Abstraction has 7614 states and 17342 transitions. [2018-12-01 19:13:41,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:13:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 17342 transitions. [2018-12-01 19:13:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-01 19:13:41,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:41,733 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] [2018-12-01 19:13:41,733 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:41,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:41,733 INFO L82 PathProgramCache]: Analyzing trace with hash 558350547, now seen corresponding path program 1 times [2018-12-01 19:13:41,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:41,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:41,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:41,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:41,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:13:41,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:13:41,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:13:41,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:13:41,779 INFO L87 Difference]: Start difference. First operand 7614 states and 17342 transitions. Second operand 6 states. [2018-12-01 19:13:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:41,952 INFO L93 Difference]: Finished difference Result 9775 states and 22056 transitions. [2018-12-01 19:13:41,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 19:13:41,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-01 19:13:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:41,958 INFO L225 Difference]: With dead ends: 9775 [2018-12-01 19:13:41,958 INFO L226 Difference]: Without dead ends: 9667 [2018-12-01 19:13:41,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:13:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9667 states. [2018-12-01 19:13:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9667 to 7441. [2018-12-01 19:13:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2018-12-01 19:13:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 16948 transitions. [2018-12-01 19:13:42,017 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 16948 transitions. Word has length 94 [2018-12-01 19:13:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:42,017 INFO L480 AbstractCegarLoop]: Abstraction has 7441 states and 16948 transitions. [2018-12-01 19:13:42,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:13:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 16948 transitions. [2018-12-01 19:13:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-01 19:13:42,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:42,022 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] [2018-12-01 19:13:42,022 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:42,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:42,023 INFO L82 PathProgramCache]: Analyzing trace with hash -679626374, now seen corresponding path program 1 times [2018-12-01 19:13:42,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:42,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:42,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:42,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:42,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:42,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:42,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 19:13:42,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 19:13:42,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 19:13:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:13:42,100 INFO L87 Difference]: Start difference. First operand 7441 states and 16948 transitions. Second operand 9 states. [2018-12-01 19:13:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:42,403 INFO L93 Difference]: Finished difference Result 10480 states and 23807 transitions. [2018-12-01 19:13:42,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 19:13:42,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-01 19:13:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:42,410 INFO L225 Difference]: With dead ends: 10480 [2018-12-01 19:13:42,410 INFO L226 Difference]: Without dead ends: 10448 [2018-12-01 19:13:42,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-01 19:13:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10448 states. [2018-12-01 19:13:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10448 to 9009. [2018-12-01 19:13:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2018-12-01 19:13:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 20408 transitions. [2018-12-01 19:13:42,478 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 20408 transitions. Word has length 94 [2018-12-01 19:13:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:42,478 INFO L480 AbstractCegarLoop]: Abstraction has 9009 states and 20408 transitions. [2018-12-01 19:13:42,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 19:13:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 20408 transitions. [2018-12-01 19:13:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-01 19:13:42,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:42,484 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] [2018-12-01 19:13:42,484 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:42,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1818389563, now seen corresponding path program 1 times [2018-12-01 19:13:42,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:42,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:42,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:42,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:42,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:42,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:42,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 19:13:42,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 19:13:42,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 19:13:42,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:13:42,556 INFO L87 Difference]: Start difference. First operand 9009 states and 20408 transitions. Second operand 8 states. [2018-12-01 19:13:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:42,829 INFO L93 Difference]: Finished difference Result 14006 states and 32226 transitions. [2018-12-01 19:13:42,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 19:13:42,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-01 19:13:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:42,839 INFO L225 Difference]: With dead ends: 14006 [2018-12-01 19:13:42,839 INFO L226 Difference]: Without dead ends: 14006 [2018-12-01 19:13:42,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 19:13:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14006 states. [2018-12-01 19:13:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14006 to 9587. [2018-12-01 19:13:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9587 states. [2018-12-01 19:13:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9587 states to 9587 states and 21909 transitions. [2018-12-01 19:13:42,938 INFO L78 Accepts]: Start accepts. Automaton has 9587 states and 21909 transitions. Word has length 94 [2018-12-01 19:13:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:42,938 INFO L480 AbstractCegarLoop]: Abstraction has 9587 states and 21909 transitions. [2018-12-01 19:13:42,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 19:13:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 21909 transitions. [2018-12-01 19:13:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-01 19:13:42,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:42,945 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] [2018-12-01 19:13:42,945 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:42,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1589074052, now seen corresponding path program 1 times [2018-12-01 19:13:42,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:42,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:42,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:43,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:43,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:13:43,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:13:43,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:13:43,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:43,010 INFO L87 Difference]: Start difference. First operand 9587 states and 21909 transitions. Second operand 7 states. [2018-12-01 19:13:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:43,111 INFO L93 Difference]: Finished difference Result 13549 states and 31264 transitions. [2018-12-01 19:13:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:13:43,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-01 19:13:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:43,120 INFO L225 Difference]: With dead ends: 13549 [2018-12-01 19:13:43,120 INFO L226 Difference]: Without dead ends: 13549 [2018-12-01 19:13:43,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-01 19:13:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13549 states. [2018-12-01 19:13:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13549 to 9658. [2018-12-01 19:13:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9658 states. [2018-12-01 19:13:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9658 states to 9658 states and 21873 transitions. [2018-12-01 19:13:43,204 INFO L78 Accepts]: Start accepts. Automaton has 9658 states and 21873 transitions. Word has length 94 [2018-12-01 19:13:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:43,204 INFO L480 AbstractCegarLoop]: Abstraction has 9658 states and 21873 transitions. [2018-12-01 19:13:43,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:13:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 9658 states and 21873 transitions. [2018-12-01 19:13:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-01 19:13:43,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:43,211 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] [2018-12-01 19:13:43,211 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:43,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:43,211 INFO L82 PathProgramCache]: Analyzing trace with hash 973917692, now seen corresponding path program 1 times [2018-12-01 19:13:43,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:43,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:43,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:43,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:43,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:43,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:43,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:13:43,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:13:43,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:13:43,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:13:43,276 INFO L87 Difference]: Start difference. First operand 9658 states and 21873 transitions. Second operand 6 states. [2018-12-01 19:13:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:43,358 INFO L93 Difference]: Finished difference Result 9178 states and 20417 transitions. [2018-12-01 19:13:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:13:43,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-01 19:13:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:43,364 INFO L225 Difference]: With dead ends: 9178 [2018-12-01 19:13:43,364 INFO L226 Difference]: Without dead ends: 9178 [2018-12-01 19:13:43,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:13:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9178 states. [2018-12-01 19:13:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9178 to 5738. [2018-12-01 19:13:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5738 states. [2018-12-01 19:13:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5738 states to 5738 states and 12776 transitions. [2018-12-01 19:13:43,418 INFO L78 Accepts]: Start accepts. Automaton has 5738 states and 12776 transitions. Word has length 94 [2018-12-01 19:13:43,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:43,418 INFO L480 AbstractCegarLoop]: Abstraction has 5738 states and 12776 transitions. [2018-12-01 19:13:43,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:13:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 5738 states and 12776 transitions. [2018-12-01 19:13:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-01 19:13:43,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:43,422 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] [2018-12-01 19:13:43,422 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:43,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:43,423 INFO L82 PathProgramCache]: Analyzing trace with hash -641852995, now seen corresponding path program 1 times [2018-12-01 19:13:43,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:43,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:43,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:43,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:43,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:43,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:43,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 19:13:43,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 19:13:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 19:13:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:13:43,518 INFO L87 Difference]: Start difference. First operand 5738 states and 12776 transitions. Second operand 9 states. [2018-12-01 19:13:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:43,773 INFO L93 Difference]: Finished difference Result 6957 states and 15368 transitions. [2018-12-01 19:13:43,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-01 19:13:43,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-01 19:13:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:43,778 INFO L225 Difference]: With dead ends: 6957 [2018-12-01 19:13:43,778 INFO L226 Difference]: Without dead ends: 6957 [2018-12-01 19:13:43,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-01 19:13:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2018-12-01 19:13:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 6701. [2018-12-01 19:13:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6701 states. [2018-12-01 19:13:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6701 states to 6701 states and 14864 transitions. [2018-12-01 19:13:43,823 INFO L78 Accepts]: Start accepts. Automaton has 6701 states and 14864 transitions. Word has length 96 [2018-12-01 19:13:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:43,823 INFO L480 AbstractCegarLoop]: Abstraction has 6701 states and 14864 transitions. [2018-12-01 19:13:43,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 19:13:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 6701 states and 14864 transitions. [2018-12-01 19:13:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-01 19:13:43,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:43,827 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] [2018-12-01 19:13:43,828 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:43,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:43,828 INFO L82 PathProgramCache]: Analyzing trace with hash 245650686, now seen corresponding path program 1 times [2018-12-01 19:13:43,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:43,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:43,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:43,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:43,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:43,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:43,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 19:13:43,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 19:13:43,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 19:13:43,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:13:43,917 INFO L87 Difference]: Start difference. First operand 6701 states and 14864 transitions. Second operand 11 states. [2018-12-01 19:13:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:44,894 INFO L93 Difference]: Finished difference Result 12830 states and 28596 transitions. [2018-12-01 19:13:44,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 19:13:44,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-01 19:13:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:44,905 INFO L225 Difference]: With dead ends: 12830 [2018-12-01 19:13:44,905 INFO L226 Difference]: Without dead ends: 8745 [2018-12-01 19:13:44,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-01 19:13:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8745 states. [2018-12-01 19:13:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8745 to 6542. [2018-12-01 19:13:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2018-12-01 19:13:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 14471 transitions. [2018-12-01 19:13:44,971 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 14471 transitions. Word has length 96 [2018-12-01 19:13:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:44,971 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 14471 transitions. [2018-12-01 19:13:44,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 19:13:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 14471 transitions. [2018-12-01 19:13:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-01 19:13:44,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:44,976 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] [2018-12-01 19:13:44,976 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:44,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash 748940697, now seen corresponding path program 1 times [2018-12-01 19:13:44,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:44,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:44,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:45,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:45,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:13:45,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:13:45,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:13:45,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:13:45,032 INFO L87 Difference]: Start difference. First operand 6542 states and 14471 transitions. Second operand 6 states. [2018-12-01 19:13:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:45,169 INFO L93 Difference]: Finished difference Result 5871 states and 12832 transitions. [2018-12-01 19:13:45,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:13:45,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-01 19:13:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:45,173 INFO L225 Difference]: With dead ends: 5871 [2018-12-01 19:13:45,173 INFO L226 Difference]: Without dead ends: 5871 [2018-12-01 19:13:45,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2018-12-01 19:13:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5487. [2018-12-01 19:13:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2018-12-01 19:13:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 12022 transitions. [2018-12-01 19:13:45,210 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 12022 transitions. Word has length 96 [2018-12-01 19:13:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:45,210 INFO L480 AbstractCegarLoop]: Abstraction has 5487 states and 12022 transitions. [2018-12-01 19:13:45,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:13:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 12022 transitions. [2018-12-01 19:13:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-01 19:13:45,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:45,213 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] [2018-12-01 19:13:45,213 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:45,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:45,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1855465141, now seen corresponding path program 2 times [2018-12-01 19:13:45,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:45,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:45,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:45,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:45,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:45,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:45,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:13:45,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:13:45,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:13:45,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:13:45,284 INFO L87 Difference]: Start difference. First operand 5487 states and 12022 transitions. Second operand 7 states. [2018-12-01 19:13:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:45,509 INFO L93 Difference]: Finished difference Result 6240 states and 13688 transitions. [2018-12-01 19:13:45,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:13:45,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-01 19:13:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:45,513 INFO L225 Difference]: With dead ends: 6240 [2018-12-01 19:13:45,513 INFO L226 Difference]: Without dead ends: 6240 [2018-12-01 19:13:45,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:13:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6240 states. [2018-12-01 19:13:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6240 to 5652. [2018-12-01 19:13:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2018-12-01 19:13:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 12377 transitions. [2018-12-01 19:13:45,552 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 12377 transitions. Word has length 96 [2018-12-01 19:13:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:45,552 INFO L480 AbstractCegarLoop]: Abstraction has 5652 states and 12377 transitions. [2018-12-01 19:13:45,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:13:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 12377 transitions. [2018-12-01 19:13:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-01 19:13:45,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:45,556 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] [2018-12-01 19:13:45,556 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:45,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:45,556 INFO L82 PathProgramCache]: Analyzing trace with hash 504375307, now seen corresponding path program 1 times [2018-12-01 19:13:45,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:45,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:45,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:45,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:13:45,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:13:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:13:45,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:13:45,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 19:13:45,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 19:13:45,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 19:13:45,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:13:45,608 INFO L87 Difference]: Start difference. First operand 5652 states and 12377 transitions. Second operand 8 states. [2018-12-01 19:13:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:13:45,976 INFO L93 Difference]: Finished difference Result 8717 states and 19079 transitions. [2018-12-01 19:13:45,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 19:13:45,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-01 19:13:45,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:13:45,982 INFO L225 Difference]: With dead ends: 8717 [2018-12-01 19:13:45,982 INFO L226 Difference]: Without dead ends: 8677 [2018-12-01 19:13:45,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-12-01 19:13:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8677 states. [2018-12-01 19:13:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8677 to 6180. [2018-12-01 19:13:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6180 states. [2018-12-01 19:13:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6180 states to 6180 states and 13475 transitions. [2018-12-01 19:13:46,032 INFO L78 Accepts]: Start accepts. Automaton has 6180 states and 13475 transitions. Word has length 96 [2018-12-01 19:13:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:13:46,032 INFO L480 AbstractCegarLoop]: Abstraction has 6180 states and 13475 transitions. [2018-12-01 19:13:46,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 19:13:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6180 states and 13475 transitions. [2018-12-01 19:13:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-01 19:13:46,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:13:46,037 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] [2018-12-01 19:13:46,037 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:13:46,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:13:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1465989324, now seen corresponding path program 2 times [2018-12-01 19:13:46,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:13:46,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:13:46,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:46,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:13:46,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:13:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:13:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:13:46,075 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 19:13:46,144 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 19:13:46,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 07:13:46 BasicIcfg [2018-12-01 19:13:46,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 19:13:46,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:13:46,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:13:46,146 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:13:46,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:13:20" (3/4) ... [2018-12-01 19:13:46,148 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 19:13:46,225 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_88a36edb-9d88-4938-b925-bd675f70fbe5/bin-2019/uautomizer/witness.graphml [2018-12-01 19:13:46,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 19:13:46,226 INFO L168 Benchmark]: Toolchain (without parser) took 26532.59 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 949.6 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-01 19:13:46,227 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:13:46,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -125.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-01 19:13:46,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-01 19:13:46,228 INFO L168 Benchmark]: Boogie Preprocessor took 20.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:13:46,228 INFO L168 Benchmark]: RCFGBuilder took 330.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:13:46,228 INFO L168 Benchmark]: TraceAbstraction took 25747.40 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-01 19:13:46,228 INFO L168 Benchmark]: Witness Printer took 79.28 ms. Allocated memory is still 4.2 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2018-12-01 19:13:46,230 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -125.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25747.40 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 79.28 ms. Allocated memory is still 4.2 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] -1 pthread_t t1611; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1611, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L703] 0 x$w_buff1 = x$w_buff0 [L704] 0 x$w_buff0 = 1 [L705] 0 x$w_buff1_used = x$w_buff0_used [L706] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L708] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L709] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L710] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L711] 0 x$r_buff0_thd1 = (_Bool)1 [L714] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L780] -1 pthread_t t1612; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] FCALL, FORK -1 pthread_create(&t1612, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L731] 1 y = 2 [L734] 1 z = 1 [L737] 1 __unbuffered_p1_EAX = z [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L750] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L717] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L759] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L718] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L719] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L720] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L720] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L721] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L788] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L790] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L791] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 25.6s OverallTime, 38 OverallIterations, 1 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10088 SDtfs, 10963 SDslu, 23646 SDs, 0 SdLazy, 10895 SolverSat, 587 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 95 SyntacticMatches, 29 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=7, 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: 9.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 177666 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2813 NumberOfCodeBlocks, 2813 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2680 ConstructedInterpolants, 0 QuantifiedInterpolants, 634549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...