./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7f00b8a2e26669f3416c65156e30bcc7eb97f9e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 06:12:47,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 06:12:47,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 06:12:47,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 06:12:47,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 06:12:47,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 06:12:47,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 06:12:47,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 06:12:47,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 06:12:47,287 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 06:12:47,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 06:12:47,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 06:12:47,288 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 06:12:47,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 06:12:47,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 06:12:47,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 06:12:47,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 06:12:47,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 06:12:47,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 06:12:47,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 06:12:47,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 06:12:47,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 06:12:47,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 06:12:47,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 06:12:47,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 06:12:47,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 06:12:47,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 06:12:47,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 06:12:47,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 06:12:47,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 06:12:47,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 06:12:47,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 06:12:47,299 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 06:12:47,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 06:12:47,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 06:12:47,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 06:12:47,301 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 06:12:47,309 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 06:12:47,309 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 06:12:47,309 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 06:12:47,309 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 06:12:47,310 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 06:12:47,310 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 06:12:47,310 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 06:12:47,310 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 06:12:47,310 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 06:12:47,310 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 06:12:47,310 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 06:12:47,311 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 06:12:47,311 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 06:12:47,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 06:12:47,311 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 06:12:47,312 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 06:12:47,312 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 06:12:47,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 06:12:47,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 06:12:47,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 06:12:47,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 06:12:47,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 06:12:47,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 06:12:47,313 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 06:12:47,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 06:12:47,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 06:12:47,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 06:12:47,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 06:12:47,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 06:12:47,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 06:12:47,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 06:12:47,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 06:12:47,314 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 06:12:47,314 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 06:12:47,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 06:12:47,314 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 06:12:47,314 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan 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 -> Taipan 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 -> f7f00b8a2e26669f3416c65156e30bcc7eb97f9e [2018-12-09 06:12:47,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 06:12:47,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 06:12:47,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 06:12:47,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 06:12:47,344 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 06:12:47,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i [2018-12-09 06:12:47,389 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/data/5913f7f8f/ea4dbb569cc4461faf9ccc80b4ef43ba/FLAG43f32fd33 [2018-12-09 06:12:47,780 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 06:12:47,780 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/sv-benchmarks/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i [2018-12-09 06:12:47,788 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/data/5913f7f8f/ea4dbb569cc4461faf9ccc80b4ef43ba/FLAG43f32fd33 [2018-12-09 06:12:47,797 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/data/5913f7f8f/ea4dbb569cc4461faf9ccc80b4ef43ba [2018-12-09 06:12:47,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 06:12:47,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 06:12:47,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 06:12:47,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 06:12:47,802 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 06:12:47,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:12:47" (1/1) ... [2018-12-09 06:12:47,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4599fb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:47, skipping insertion in model container [2018-12-09 06:12:47,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:12:47" (1/1) ... [2018-12-09 06:12:47,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 06:12:47,837 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 06:12:48,048 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:12:48,057 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 06:12:48,143 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:12:48,178 INFO L195 MainTranslator]: Completed translation [2018-12-09 06:12:48,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48 WrapperNode [2018-12-09 06:12:48,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 06:12:48,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 06:12:48,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 06:12:48,179 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 06:12:48,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... [2018-12-09 06:12:48,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... [2018-12-09 06:12:48,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 06:12:48,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 06:12:48,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 06:12:48,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 06:12:48,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... [2018-12-09 06:12:48,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... [2018-12-09 06:12:48,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... [2018-12-09 06:12:48,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... [2018-12-09 06:12:48,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... [2018-12-09 06:12:48,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... [2018-12-09 06:12:48,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... [2018-12-09 06:12:48,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 06:12:48,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 06:12:48,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 06:12:48,239 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 06:12:48,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/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-09 06:12:48,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 06:12:48,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 06:12:48,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 06:12:48,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 06:12:48,270 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 06:12:48,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 06:12:48,271 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 06:12:48,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 06:12:48,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 06:12:48,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 06:12:48,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 06:12:48,272 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 06:12:48,574 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 06:12:48,574 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 06:12:48,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:12:48 BoogieIcfgContainer [2018-12-09 06:12:48,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 06:12:48,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 06:12:48,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 06:12:48,578 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 06:12:48,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:12:47" (1/3) ... [2018-12-09 06:12:48,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365c41a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:12:48, skipping insertion in model container [2018-12-09 06:12:48,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:12:48" (2/3) ... [2018-12-09 06:12:48,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365c41a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:12:48, skipping insertion in model container [2018-12-09 06:12:48,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:12:48" (3/3) ... [2018-12-09 06:12:48,580 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_rmo.opt_false-unreach-call.i [2018-12-09 06:12:48,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,604 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,604 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,608 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,609 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,610 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,610 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,610 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,610 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,610 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 06:12:48,620 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 06:12:48,621 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 06:12:48,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 06:12:48,640 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 06:12:48,654 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 06:12:48,654 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 06:12:48,654 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 06:12:48,654 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 06:12:48,655 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 06:12:48,655 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 06:12:48,655 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 06:12:48,655 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 06:12:48,663 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 06:12:49,649 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-09 06:12:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-09 06:12:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 06:12:49,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:49,657 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] [2018-12-09 06:12:49,658 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:49,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-09 06:12:49,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:49,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:49,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:49,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:49,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:49,818 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-09 06:12:49,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:49,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:12:49,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:49,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 06:12:49,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 06:12:49,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 06:12:49,832 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-09 06:12:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:50,181 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-09 06:12:50,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 06:12:50,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 06:12:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:50,334 INFO L225 Difference]: With dead ends: 45389 [2018-12-09 06:12:50,334 INFO L226 Difference]: Without dead ends: 40629 [2018-12-09 06:12:50,335 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-09 06:12:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-09 06:12:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-09 06:12:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 06:12:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-09 06:12:51,079 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-09 06:12:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:51,080 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-09 06:12:51,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 06:12:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-09 06:12:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 06:12:51,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:51,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:12:51,083 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:51,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2018-12-09 06:12:51,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:51,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:51,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:51,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:51,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:51,118 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-09 06:12:51,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:51,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:12:51,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:51,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:12:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:12:51,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:12:51,119 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-09 06:12:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:51,265 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-09 06:12:51,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:12:51,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 06:12:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:51,320 INFO L225 Difference]: With dead ends: 23663 [2018-12-09 06:12:51,320 INFO L226 Difference]: Without dead ends: 23663 [2018-12-09 06:12:51,321 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-09 06:12:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-09 06:12:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-09 06:12:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 06:12:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-09 06:12:51,749 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-09 06:12:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:51,750 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-09 06:12:51,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:12:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-09 06:12:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 06:12:51,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:51,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:12:51,752 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:51,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:51,753 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2018-12-09 06:12:51,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:51,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:51,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:51,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:51,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:51,811 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-09 06:12:51,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:51,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:12:51,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:51,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:12:51,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:12:51,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:12:51,812 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-09 06:12:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:52,259 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-09 06:12:52,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 06:12:52,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 06:12:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:52,472 INFO L225 Difference]: With dead ends: 64831 [2018-12-09 06:12:52,472 INFO L226 Difference]: Without dead ends: 64671 [2018-12-09 06:12:52,473 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-09 06:12:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-09 06:12:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-09 06:12:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 06:12:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-09 06:12:53,188 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-09 06:12:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:53,189 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-09 06:12:53,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:12:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-09 06:12:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 06:12:53,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:53,192 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-09 06:12:53,192 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:53,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-09 06:12:53,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:53,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:53,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:53,226 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-09 06:12:53,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:53,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:12:53,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:53,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:12:53,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:12:53,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:12:53,228 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-09 06:12:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:53,490 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-09 06:12:53,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:12:53,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-09 06:12:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:53,550 INFO L225 Difference]: With dead ends: 37143 [2018-12-09 06:12:53,550 INFO L226 Difference]: Without dead ends: 37143 [2018-12-09 06:12:53,550 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-09 06:12:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-09 06:12:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-09 06:12:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 06:12:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-09 06:12:54,054 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-09 06:12:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:54,055 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-09 06:12:54,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:12:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-09 06:12:54,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 06:12:54,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:54,056 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-09 06:12:54,056 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:54,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:54,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1043159878, now seen corresponding path program 1 times [2018-12-09 06:12:54,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:54,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:54,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:54,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:54,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:54,097 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-09 06:12:54,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:54,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:12:54,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:54,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:12:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:12:54,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:12:54,098 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 5 states. [2018-12-09 06:12:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:54,559 INFO L93 Difference]: Finished difference Result 66627 states and 246193 transitions. [2018-12-09 06:12:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 06:12:54,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 06:12:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:54,681 INFO L225 Difference]: With dead ends: 66627 [2018-12-09 06:12:54,681 INFO L226 Difference]: Without dead ends: 66459 [2018-12-09 06:12:54,681 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-09 06:12:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-09 06:12:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-09 06:12:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-09 06:12:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143650 transitions. [2018-12-09 06:12:55,395 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143650 transitions. Word has length 46 [2018-12-09 06:12:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:55,395 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143650 transitions. [2018-12-09 06:12:55,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:12:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143650 transitions. [2018-12-09 06:12:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 06:12:55,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:55,401 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-09 06:12:55,401 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:55,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash 942235242, now seen corresponding path program 1 times [2018-12-09 06:12:55,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:55,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:55,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:55,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:55,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:55,442 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-09 06:12:55,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:55,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:12:55,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:55,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 06:12:55,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 06:12:55,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 06:12:55,443 INFO L87 Difference]: Start difference. First operand 38835 states and 143650 transitions. Second operand 4 states. [2018-12-09 06:12:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:55,499 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-12-09 06:12:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 06:12:55,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 06:12:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:55,516 INFO L225 Difference]: With dead ends: 14217 [2018-12-09 06:12:55,516 INFO L226 Difference]: Without dead ends: 13696 [2018-12-09 06:12:55,517 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-09 06:12:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-09 06:12:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-09 06:12:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-09 06:12:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-12-09 06:12:55,667 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-12-09 06:12:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:55,667 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-12-09 06:12:55,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 06:12:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-12-09 06:12:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 06:12:55,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:55,671 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] [2018-12-09 06:12:55,671 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:55,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2018-12-09 06:12:55,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:55,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:55,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:55,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:55,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:55,730 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-09 06:12:55,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:55,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:12:55,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:55,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 06:12:55,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 06:12:55,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 06:12:55,732 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-12-09 06:12:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:55,890 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-12-09 06:12:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 06:12:55,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 06:12:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:55,913 INFO L225 Difference]: With dead ends: 19084 [2018-12-09 06:12:55,913 INFO L226 Difference]: Without dead ends: 19084 [2018-12-09 06:12:55,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:12:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-12-09 06:12:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-12-09 06:12:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-12-09 06:12:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-12-09 06:12:56,091 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-12-09 06:12:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:56,092 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-12-09 06:12:56,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 06:12:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-12-09 06:12:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 06:12:56,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:56,095 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] [2018-12-09 06:12:56,096 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:56,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2018-12-09 06:12:56,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:56,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:56,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:56,135 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-09 06:12:56,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:56,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:12:56,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:56,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 06:12:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 06:12:56,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 06:12:56,137 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 4 states. [2018-12-09 06:12:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:56,542 INFO L93 Difference]: Finished difference Result 20683 states and 67222 transitions. [2018-12-09 06:12:56,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 06:12:56,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 06:12:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:56,566 INFO L225 Difference]: With dead ends: 20683 [2018-12-09 06:12:56,566 INFO L226 Difference]: Without dead ends: 20683 [2018-12-09 06:12:56,567 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-09 06:12:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20683 states. [2018-12-09 06:12:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20683 to 18616. [2018-12-09 06:12:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18616 states. [2018-12-09 06:12:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 60973 transitions. [2018-12-09 06:12:56,774 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 60973 transitions. Word has length 59 [2018-12-09 06:12:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:56,774 INFO L480 AbstractCegarLoop]: Abstraction has 18616 states and 60973 transitions. [2018-12-09 06:12:56,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 06:12:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 60973 transitions. [2018-12-09 06:12:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 06:12:56,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:56,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:12:56,777 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:56,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash 297470870, now seen corresponding path program 1 times [2018-12-09 06:12:56,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:56,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:56,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:56,826 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-09 06:12:56,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:56,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 06:12:56,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:56,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 06:12:56,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 06:12:56,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:12:56,827 INFO L87 Difference]: Start difference. First operand 18616 states and 60973 transitions. Second operand 6 states. [2018-12-09 06:12:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:57,154 INFO L93 Difference]: Finished difference Result 24160 states and 78371 transitions. [2018-12-09 06:12:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 06:12:57,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-09 06:12:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:57,183 INFO L225 Difference]: With dead ends: 24160 [2018-12-09 06:12:57,183 INFO L226 Difference]: Without dead ends: 24128 [2018-12-09 06:12:57,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 06:12:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24128 states. [2018-12-09 06:12:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24128 to 18248. [2018-12-09 06:12:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18248 states. [2018-12-09 06:12:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18248 states to 18248 states and 59757 transitions. [2018-12-09 06:12:57,404 INFO L78 Accepts]: Start accepts. Automaton has 18248 states and 59757 transitions. Word has length 59 [2018-12-09 06:12:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:57,405 INFO L480 AbstractCegarLoop]: Abstraction has 18248 states and 59757 transitions. [2018-12-09 06:12:57,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 06:12:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 18248 states and 59757 transitions. [2018-12-09 06:12:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 06:12:57,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:57,415 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-09 06:12:57,415 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:57,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:57,416 INFO L82 PathProgramCache]: Analyzing trace with hash 508362432, now seen corresponding path program 1 times [2018-12-09 06:12:57,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:57,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:57,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:57,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:57,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:57,466 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-09 06:12:57,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:57,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:12:57,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:57,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 06:12:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 06:12:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 06:12:57,467 INFO L87 Difference]: Start difference. First operand 18248 states and 59757 transitions. Second operand 4 states. [2018-12-09 06:12:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:57,782 INFO L93 Difference]: Finished difference Result 29316 states and 94246 transitions. [2018-12-09 06:12:57,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 06:12:57,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-09 06:12:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:57,819 INFO L225 Difference]: With dead ends: 29316 [2018-12-09 06:12:57,819 INFO L226 Difference]: Without dead ends: 29120 [2018-12-09 06:12:57,819 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-09 06:12:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29120 states. [2018-12-09 06:12:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29120 to 24768. [2018-12-09 06:12:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24768 states. [2018-12-09 06:12:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24768 states to 24768 states and 80579 transitions. [2018-12-09 06:12:58,123 INFO L78 Accepts]: Start accepts. Automaton has 24768 states and 80579 transitions. Word has length 73 [2018-12-09 06:12:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:58,123 INFO L480 AbstractCegarLoop]: Abstraction has 24768 states and 80579 transitions. [2018-12-09 06:12:58,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 06:12:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 24768 states and 80579 transitions. [2018-12-09 06:12:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 06:12:58,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:58,138 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-09 06:12:58,138 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:58,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1861672129, now seen corresponding path program 1 times [2018-12-09 06:12:58,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:58,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:58,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:58,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:58,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:58,217 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-09 06:12:58,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:58,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 06:12:58,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:58,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 06:12:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 06:12:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 06:12:58,218 INFO L87 Difference]: Start difference. First operand 24768 states and 80579 transitions. Second operand 8 states. [2018-12-09 06:12:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:58,895 INFO L93 Difference]: Finished difference Result 37722 states and 118602 transitions. [2018-12-09 06:12:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 06:12:58,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-12-09 06:12:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:12:58,940 INFO L225 Difference]: With dead ends: 37722 [2018-12-09 06:12:58,940 INFO L226 Difference]: Without dead ends: 37474 [2018-12-09 06:12:58,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 06:12:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37474 states. [2018-12-09 06:12:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37474 to 27365. [2018-12-09 06:12:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27365 states. [2018-12-09 06:12:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27365 states to 27365 states and 88367 transitions. [2018-12-09 06:12:59,294 INFO L78 Accepts]: Start accepts. Automaton has 27365 states and 88367 transitions. Word has length 73 [2018-12-09 06:12:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:12:59,295 INFO L480 AbstractCegarLoop]: Abstraction has 27365 states and 88367 transitions. [2018-12-09 06:12:59,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 06:12:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 27365 states and 88367 transitions. [2018-12-09 06:12:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 06:12:59,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:12:59,311 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-09 06:12:59,311 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:12:59,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:12:59,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1568269122, now seen corresponding path program 1 times [2018-12-09 06:12:59,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:12:59,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:59,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:12:59,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:12:59,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:12:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:12:59,364 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-09 06:12:59,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:12:59,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 06:12:59,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:12:59,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 06:12:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 06:12:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 06:12:59,364 INFO L87 Difference]: Start difference. First operand 27365 states and 88367 transitions. Second operand 8 states. [2018-12-09 06:12:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:12:59,999 INFO L93 Difference]: Finished difference Result 34993 states and 111268 transitions. [2018-12-09 06:12:59,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 06:12:59,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-12-09 06:13:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:00,043 INFO L225 Difference]: With dead ends: 34993 [2018-12-09 06:13:00,043 INFO L226 Difference]: Without dead ends: 34929 [2018-12-09 06:13:00,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-12-09 06:13:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34929 states. [2018-12-09 06:13:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34929 to 29457. [2018-12-09 06:13:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29457 states. [2018-12-09 06:13:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29457 states to 29457 states and 94772 transitions. [2018-12-09 06:13:00,400 INFO L78 Accepts]: Start accepts. Automaton has 29457 states and 94772 transitions. Word has length 73 [2018-12-09 06:13:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:00,400 INFO L480 AbstractCegarLoop]: Abstraction has 29457 states and 94772 transitions. [2018-12-09 06:13:00,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 06:13:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 29457 states and 94772 transitions. [2018-12-09 06:13:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 06:13:00,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:00,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:13:00,419 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:00,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash 749030577, now seen corresponding path program 1 times [2018-12-09 06:13:00,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:00,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:00,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:00,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:00,455 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-09 06:13:00,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:00,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:13:00,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:00,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:13:00,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:13:00,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:13:00,456 INFO L87 Difference]: Start difference. First operand 29457 states and 94772 transitions. Second operand 3 states. [2018-12-09 06:13:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:00,558 INFO L93 Difference]: Finished difference Result 34177 states and 108640 transitions. [2018-12-09 06:13:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:13:00,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-09 06:13:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:00,600 INFO L225 Difference]: With dead ends: 34177 [2018-12-09 06:13:00,600 INFO L226 Difference]: Without dead ends: 34177 [2018-12-09 06:13:00,600 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-09 06:13:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34177 states. [2018-12-09 06:13:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34177 to 31025. [2018-12-09 06:13:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31025 states. [2018-12-09 06:13:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31025 states to 31025 states and 99252 transitions. [2018-12-09 06:13:01,017 INFO L78 Accepts]: Start accepts. Automaton has 31025 states and 99252 transitions. Word has length 75 [2018-12-09 06:13:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:01,018 INFO L480 AbstractCegarLoop]: Abstraction has 31025 states and 99252 transitions. [2018-12-09 06:13:01,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:13:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31025 states and 99252 transitions. [2018-12-09 06:13:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 06:13:01,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:01,038 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] [2018-12-09 06:13:01,038 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:01,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:01,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1031472080, now seen corresponding path program 1 times [2018-12-09 06:13:01,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:01,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:01,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:01,145 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-09 06:13:01,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:01,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 06:13:01,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:01,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 06:13:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 06:13:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 06:13:01,146 INFO L87 Difference]: Start difference. First operand 31025 states and 99252 transitions. Second operand 10 states. [2018-12-09 06:13:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:02,060 INFO L93 Difference]: Finished difference Result 40629 states and 126835 transitions. [2018-12-09 06:13:02,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 06:13:02,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-12-09 06:13:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:02,116 INFO L225 Difference]: With dead ends: 40629 [2018-12-09 06:13:02,116 INFO L226 Difference]: Without dead ends: 40565 [2018-12-09 06:13:02,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 06:13:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40565 states. [2018-12-09 06:13:02,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40565 to 33477. [2018-12-09 06:13:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33477 states. [2018-12-09 06:13:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33477 states to 33477 states and 106323 transitions. [2018-12-09 06:13:02,510 INFO L78 Accepts]: Start accepts. Automaton has 33477 states and 106323 transitions. Word has length 79 [2018-12-09 06:13:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:02,510 INFO L480 AbstractCegarLoop]: Abstraction has 33477 states and 106323 transitions. [2018-12-09 06:13:02,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 06:13:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33477 states and 106323 transitions. [2018-12-09 06:13:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 06:13:02,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:02,535 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] [2018-12-09 06:13:02,535 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:02,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:02,535 INFO L82 PathProgramCache]: Analyzing trace with hash -341105651, now seen corresponding path program 1 times [2018-12-09 06:13:02,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:02,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:02,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:02,575 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-09 06:13:02,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:02,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 06:13:02,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:02,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 06:13:02,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 06:13:02,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 06:13:02,575 INFO L87 Difference]: Start difference. First operand 33477 states and 106323 transitions. Second operand 4 states. [2018-12-09 06:13:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:02,794 INFO L93 Difference]: Finished difference Result 39513 states and 123931 transitions. [2018-12-09 06:13:02,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 06:13:02,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 06:13:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:02,842 INFO L225 Difference]: With dead ends: 39513 [2018-12-09 06:13:02,842 INFO L226 Difference]: Without dead ends: 39273 [2018-12-09 06:13:02,842 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-09 06:13:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39273 states. [2018-12-09 06:13:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39273 to 37605. [2018-12-09 06:13:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37605 states. [2018-12-09 06:13:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37605 states to 37605 states and 118468 transitions. [2018-12-09 06:13:03,263 INFO L78 Accepts]: Start accepts. Automaton has 37605 states and 118468 transitions. Word has length 81 [2018-12-09 06:13:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:03,264 INFO L480 AbstractCegarLoop]: Abstraction has 37605 states and 118468 transitions. [2018-12-09 06:13:03,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 06:13:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 37605 states and 118468 transitions. [2018-12-09 06:13:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 06:13:03,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:03,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] [2018-12-09 06:13:03,291 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:03,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:03,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2018201358, now seen corresponding path program 1 times [2018-12-09 06:13:03,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:03,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:03,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:03,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:03,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:03,321 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-09 06:13:03,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:03,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:13:03,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:03,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:13:03,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:13:03,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:13:03,322 INFO L87 Difference]: Start difference. First operand 37605 states and 118468 transitions. Second operand 3 states. [2018-12-09 06:13:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:03,499 INFO L93 Difference]: Finished difference Result 39589 states and 124426 transitions. [2018-12-09 06:13:03,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:13:03,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 06:13:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:03,548 INFO L225 Difference]: With dead ends: 39589 [2018-12-09 06:13:03,548 INFO L226 Difference]: Without dead ends: 39589 [2018-12-09 06:13:03,548 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-09 06:13:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39589 states. [2018-12-09 06:13:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39589 to 38593. [2018-12-09 06:13:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38593 states. [2018-12-09 06:13:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38593 states to 38593 states and 121424 transitions. [2018-12-09 06:13:04,061 INFO L78 Accepts]: Start accepts. Automaton has 38593 states and 121424 transitions. Word has length 81 [2018-12-09 06:13:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:04,061 INFO L480 AbstractCegarLoop]: Abstraction has 38593 states and 121424 transitions. [2018-12-09 06:13:04,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:13:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 38593 states and 121424 transitions. [2018-12-09 06:13:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 06:13:04,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:04,085 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] [2018-12-09 06:13:04,085 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:04,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:04,086 INFO L82 PathProgramCache]: Analyzing trace with hash -259330474, now seen corresponding path program 1 times [2018-12-09 06:13:04,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:04,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:04,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:04,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:04,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:04,115 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-09 06:13:04,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:04,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:13:04,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:04,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:13:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:13:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:13:04,115 INFO L87 Difference]: Start difference. First operand 38593 states and 121424 transitions. Second operand 3 states. [2018-12-09 06:13:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:04,212 INFO L93 Difference]: Finished difference Result 36440 states and 112816 transitions. [2018-12-09 06:13:04,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:13:04,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-09 06:13:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:04,256 INFO L225 Difference]: With dead ends: 36440 [2018-12-09 06:13:04,256 INFO L226 Difference]: Without dead ends: 36440 [2018-12-09 06:13:04,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:13:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36440 states. [2018-12-09 06:13:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36440 to 34804. [2018-12-09 06:13:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34804 states. [2018-12-09 06:13:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34804 states to 34804 states and 108109 transitions. [2018-12-09 06:13:04,635 INFO L78 Accepts]: Start accepts. Automaton has 34804 states and 108109 transitions. Word has length 82 [2018-12-09 06:13:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:04,636 INFO L480 AbstractCegarLoop]: Abstraction has 34804 states and 108109 transitions. [2018-12-09 06:13:04,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:13:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 34804 states and 108109 transitions. [2018-12-09 06:13:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 06:13:04,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:04,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:13:04,659 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:04,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:04,659 INFO L82 PathProgramCache]: Analyzing trace with hash 70435287, now seen corresponding path program 1 times [2018-12-09 06:13:04,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:04,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:04,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:04,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:04,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:04,708 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-09 06:13:04,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:04,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 06:13:04,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:04,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 06:13:04,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 06:13:04,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:13:04,709 INFO L87 Difference]: Start difference. First operand 34804 states and 108109 transitions. Second operand 7 states. [2018-12-09 06:13:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:05,413 INFO L93 Difference]: Finished difference Result 61448 states and 189280 transitions. [2018-12-09 06:13:05,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 06:13:05,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-09 06:13:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:05,492 INFO L225 Difference]: With dead ends: 61448 [2018-12-09 06:13:05,492 INFO L226 Difference]: Without dead ends: 61112 [2018-12-09 06:13:05,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 06:13:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61112 states. [2018-12-09 06:13:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61112 to 36161. [2018-12-09 06:13:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36161 states. [2018-12-09 06:13:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36161 states to 36161 states and 112088 transitions. [2018-12-09 06:13:06,024 INFO L78 Accepts]: Start accepts. Automaton has 36161 states and 112088 transitions. Word has length 82 [2018-12-09 06:13:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:06,025 INFO L480 AbstractCegarLoop]: Abstraction has 36161 states and 112088 transitions. [2018-12-09 06:13:06,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 06:13:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 36161 states and 112088 transitions. [2018-12-09 06:13:06,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 06:13:06,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:06,049 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] [2018-12-09 06:13:06,049 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:06,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:06,049 INFO L82 PathProgramCache]: Analyzing trace with hash -852248296, now seen corresponding path program 1 times [2018-12-09 06:13:06,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:06,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:06,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:06,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:06,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:06,142 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-09 06:13:06,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:06,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 06:13:06,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:06,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 06:13:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 06:13:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 06:13:06,142 INFO L87 Difference]: Start difference. First operand 36161 states and 112088 transitions. Second operand 8 states. [2018-12-09 06:13:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:06,877 INFO L93 Difference]: Finished difference Result 53145 states and 161315 transitions. [2018-12-09 06:13:06,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 06:13:06,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-09 06:13:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:06,943 INFO L225 Difference]: With dead ends: 53145 [2018-12-09 06:13:06,944 INFO L226 Difference]: Without dead ends: 53145 [2018-12-09 06:13:06,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-09 06:13:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53145 states. [2018-12-09 06:13:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53145 to 35117. [2018-12-09 06:13:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35117 states. [2018-12-09 06:13:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35117 states to 35117 states and 108430 transitions. [2018-12-09 06:13:07,508 INFO L78 Accepts]: Start accepts. Automaton has 35117 states and 108430 transitions. Word has length 82 [2018-12-09 06:13:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:07,508 INFO L480 AbstractCegarLoop]: Abstraction has 35117 states and 108430 transitions. [2018-12-09 06:13:07,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 06:13:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 35117 states and 108430 transitions. [2018-12-09 06:13:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 06:13:07,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:07,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:13:07,531 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:07,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:07,531 INFO L82 PathProgramCache]: Analyzing trace with hash 873232601, now seen corresponding path program 1 times [2018-12-09 06:13:07,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:07,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:07,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:07,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:07,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:07,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-09 06:13:07,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:07,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:13:07,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:07,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:13:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:13:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:13:07,555 INFO L87 Difference]: Start difference. First operand 35117 states and 108430 transitions. Second operand 5 states. [2018-12-09 06:13:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:07,591 INFO L93 Difference]: Finished difference Result 4641 states and 11865 transitions. [2018-12-09 06:13:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 06:13:07,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 06:13:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:07,594 INFO L225 Difference]: With dead ends: 4641 [2018-12-09 06:13:07,594 INFO L226 Difference]: Without dead ends: 4025 [2018-12-09 06:13:07,595 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-09 06:13:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-12-09 06:13:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3903. [2018-12-09 06:13:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3903 states. [2018-12-09 06:13:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 9981 transitions. [2018-12-09 06:13:07,630 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 9981 transitions. Word has length 82 [2018-12-09 06:13:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:07,630 INFO L480 AbstractCegarLoop]: Abstraction has 3903 states and 9981 transitions. [2018-12-09 06:13:07,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:13:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 9981 transitions. [2018-12-09 06:13:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 06:13:07,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:07,633 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-09 06:13:07,633 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:07,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash 585677774, now seen corresponding path program 1 times [2018-12-09 06:13:07,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:07,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:07,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:07,713 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-09 06:13:07,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:07,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 06:13:07,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:07,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 06:13:07,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 06:13:07,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 06:13:07,714 INFO L87 Difference]: Start difference. First operand 3903 states and 9981 transitions. Second operand 8 states. [2018-12-09 06:13:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:08,108 INFO L93 Difference]: Finished difference Result 6980 states and 17751 transitions. [2018-12-09 06:13:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 06:13:08,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 06:13:08,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:08,112 INFO L225 Difference]: With dead ends: 6980 [2018-12-09 06:13:08,112 INFO L226 Difference]: Without dead ends: 6948 [2018-12-09 06:13:08,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 06:13:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2018-12-09 06:13:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 4115. [2018-12-09 06:13:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4115 states. [2018-12-09 06:13:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 10495 transitions. [2018-12-09 06:13:08,147 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 10495 transitions. Word has length 94 [2018-12-09 06:13:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:08,147 INFO L480 AbstractCegarLoop]: Abstraction has 4115 states and 10495 transitions. [2018-12-09 06:13:08,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 06:13:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 10495 transitions. [2018-12-09 06:13:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 06:13:08,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:08,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:13:08,150 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:08,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:08,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1547291791, now seen corresponding path program 1 times [2018-12-09 06:13:08,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:08,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:08,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:08,186 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-09 06:13:08,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:08,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:13:08,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:08,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:13:08,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:13:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:13:08,187 INFO L87 Difference]: Start difference. First operand 4115 states and 10495 transitions. Second operand 5 states. [2018-12-09 06:13:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:08,291 INFO L93 Difference]: Finished difference Result 4847 states and 12188 transitions. [2018-12-09 06:13:08,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 06:13:08,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 06:13:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:08,294 INFO L225 Difference]: With dead ends: 4847 [2018-12-09 06:13:08,294 INFO L226 Difference]: Without dead ends: 4847 [2018-12-09 06:13:08,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-09 06:13:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2018-12-09 06:13:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4271. [2018-12-09 06:13:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4271 states. [2018-12-09 06:13:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 10831 transitions. [2018-12-09 06:13:08,325 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 10831 transitions. Word has length 94 [2018-12-09 06:13:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:08,325 INFO L480 AbstractCegarLoop]: Abstraction has 4271 states and 10831 transitions. [2018-12-09 06:13:08,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:13:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 10831 transitions. [2018-12-09 06:13:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 06:13:08,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:08,328 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-09 06:13:08,328 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:08,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1578007363, now seen corresponding path program 1 times [2018-12-09 06:13:08,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:08,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:08,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:08,370 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-09 06:13:08,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:08,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 06:13:08,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:08,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 06:13:08,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 06:13:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:13:08,371 INFO L87 Difference]: Start difference. First operand 4271 states and 10831 transitions. Second operand 6 states. [2018-12-09 06:13:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:08,552 INFO L93 Difference]: Finished difference Result 4582 states and 11436 transitions. [2018-12-09 06:13:08,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 06:13:08,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 06:13:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:08,555 INFO L225 Difference]: With dead ends: 4582 [2018-12-09 06:13:08,555 INFO L226 Difference]: Without dead ends: 4545 [2018-12-09 06:13:08,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:13:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2018-12-09 06:13:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4457. [2018-12-09 06:13:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4457 states. [2018-12-09 06:13:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 11198 transitions. [2018-12-09 06:13:08,584 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 11198 transitions. Word has length 94 [2018-12-09 06:13:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:08,584 INFO L480 AbstractCegarLoop]: Abstraction has 4457 states and 11198 transitions. [2018-12-09 06:13:08,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 06:13:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 11198 transitions. [2018-12-09 06:13:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 06:13:08,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:08,586 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-09 06:13:08,587 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:08,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash 122733116, now seen corresponding path program 1 times [2018-12-09 06:13:08,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:08,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:08,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:08,642 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-09 06:13:08,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:08,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 06:13:08,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:08,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 06:13:08,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 06:13:08,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:13:08,643 INFO L87 Difference]: Start difference. First operand 4457 states and 11198 transitions. Second operand 7 states. [2018-12-09 06:13:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:08,825 INFO L93 Difference]: Finished difference Result 4757 states and 11937 transitions. [2018-12-09 06:13:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 06:13:08,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 06:13:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:08,828 INFO L225 Difference]: With dead ends: 4757 [2018-12-09 06:13:08,829 INFO L226 Difference]: Without dead ends: 4757 [2018-12-09 06:13:08,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:13:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2018-12-09 06:13:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4431. [2018-12-09 06:13:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4431 states. [2018-12-09 06:13:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 11153 transitions. [2018-12-09 06:13:08,859 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 11153 transitions. Word has length 94 [2018-12-09 06:13:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:08,859 INFO L480 AbstractCegarLoop]: Abstraction has 4431 states and 11153 transitions. [2018-12-09 06:13:08,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 06:13:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 11153 transitions. [2018-12-09 06:13:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 06:13:08,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:08,861 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-09 06:13:08,861 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:08,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1533612636, now seen corresponding path program 1 times [2018-12-09 06:13:08,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:08,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:08,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:08,893 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-09 06:13:08,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:08,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:13:08,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:08,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:13:08,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:13:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:13:08,894 INFO L87 Difference]: Start difference. First operand 4431 states and 11153 transitions. Second operand 5 states. [2018-12-09 06:13:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:09,000 INFO L93 Difference]: Finished difference Result 9148 states and 23163 transitions. [2018-12-09 06:13:09,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 06:13:09,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 06:13:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:09,007 INFO L225 Difference]: With dead ends: 9148 [2018-12-09 06:13:09,008 INFO L226 Difference]: Without dead ends: 9148 [2018-12-09 06:13:09,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 06:13:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9148 states. [2018-12-09 06:13:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9148 to 4531. [2018-12-09 06:13:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2018-12-09 06:13:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 11382 transitions. [2018-12-09 06:13:09,057 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 11382 transitions. Word has length 94 [2018-12-09 06:13:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:09,057 INFO L480 AbstractCegarLoop]: Abstraction has 4531 states and 11382 transitions. [2018-12-09 06:13:09,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:13:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 11382 transitions. [2018-12-09 06:13:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 06:13:09,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:09,060 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-09 06:13:09,060 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:09,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:09,061 INFO L82 PathProgramCache]: Analyzing trace with hash 928337627, now seen corresponding path program 1 times [2018-12-09 06:13:09,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:09,116 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-09 06:13:09,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:09,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:13:09,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:09,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:13:09,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:13:09,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:13:09,117 INFO L87 Difference]: Start difference. First operand 4531 states and 11382 transitions. Second operand 5 states. [2018-12-09 06:13:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:09,182 INFO L93 Difference]: Finished difference Result 4202 states and 10553 transitions. [2018-12-09 06:13:09,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 06:13:09,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 06:13:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:09,185 INFO L225 Difference]: With dead ends: 4202 [2018-12-09 06:13:09,185 INFO L226 Difference]: Without dead ends: 4202 [2018-12-09 06:13:09,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:13:09,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2018-12-09 06:13:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 4108. [2018-12-09 06:13:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4108 states. [2018-12-09 06:13:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 10355 transitions. [2018-12-09 06:13:09,212 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 10355 transitions. Word has length 94 [2018-12-09 06:13:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:09,212 INFO L480 AbstractCegarLoop]: Abstraction has 4108 states and 10355 transitions. [2018-12-09 06:13:09,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:13:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 10355 transitions. [2018-12-09 06:13:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 06:13:09,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:09,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:13:09,215 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:09,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash -140505574, now seen corresponding path program 1 times [2018-12-09 06:13:09,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:09,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:09,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:09,278 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-09 06:13:09,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:09,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 06:13:09,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:09,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 06:13:09,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 06:13:09,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:13:09,279 INFO L87 Difference]: Start difference. First operand 4108 states and 10355 transitions. Second operand 6 states. [2018-12-09 06:13:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:09,386 INFO L93 Difference]: Finished difference Result 3868 states and 9563 transitions. [2018-12-09 06:13:09,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 06:13:09,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 06:13:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:09,389 INFO L225 Difference]: With dead ends: 3868 [2018-12-09 06:13:09,389 INFO L226 Difference]: Without dead ends: 3868 [2018-12-09 06:13:09,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:13:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2018-12-09 06:13:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3305. [2018-12-09 06:13:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-12-09 06:13:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 8242 transitions. [2018-12-09 06:13:09,413 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 8242 transitions. Word has length 94 [2018-12-09 06:13:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:09,413 INFO L480 AbstractCegarLoop]: Abstraction has 3305 states and 8242 transitions. [2018-12-09 06:13:09,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 06:13:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 8242 transitions. [2018-12-09 06:13:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 06:13:09,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:09,415 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-09 06:13:09,415 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:09,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1976571392, now seen corresponding path program 1 times [2018-12-09 06:13:09,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:09,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:09,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:09,474 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-09 06:13:09,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:09,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 06:13:09,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:09,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 06:13:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 06:13:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:13:09,475 INFO L87 Difference]: Start difference. First operand 3305 states and 8242 transitions. Second operand 7 states. [2018-12-09 06:13:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:09,599 INFO L93 Difference]: Finished difference Result 3314 states and 8245 transitions. [2018-12-09 06:13:09,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 06:13:09,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 06:13:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:09,602 INFO L225 Difference]: With dead ends: 3314 [2018-12-09 06:13:09,602 INFO L226 Difference]: Without dead ends: 3314 [2018-12-09 06:13:09,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 06:13:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-12-09 06:13:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 3270. [2018-12-09 06:13:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2018-12-09 06:13:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 8161 transitions. [2018-12-09 06:13:09,624 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 8161 transitions. Word has length 96 [2018-12-09 06:13:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:09,625 INFO L480 AbstractCegarLoop]: Abstraction has 3270 states and 8161 transitions. [2018-12-09 06:13:09,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 06:13:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 8161 transitions. [2018-12-09 06:13:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 06:13:09,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:09,626 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-09 06:13:09,627 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:09,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1403397184, now seen corresponding path program 1 times [2018-12-09 06:13:09,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:09,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:09,658 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-09 06:13:09,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:09,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:13:09,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:09,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:13:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:13:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:13:09,659 INFO L87 Difference]: Start difference. First operand 3270 states and 8161 transitions. Second operand 5 states. [2018-12-09 06:13:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:09,750 INFO L93 Difference]: Finished difference Result 3718 states and 9265 transitions. [2018-12-09 06:13:09,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 06:13:09,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 06:13:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:09,753 INFO L225 Difference]: With dead ends: 3718 [2018-12-09 06:13:09,753 INFO L226 Difference]: Without dead ends: 3686 [2018-12-09 06:13:09,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 06:13:09,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2018-12-09 06:13:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3086. [2018-12-09 06:13:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3086 states. [2018-12-09 06:13:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 7702 transitions. [2018-12-09 06:13:09,775 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 7702 transitions. Word has length 96 [2018-12-09 06:13:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:09,775 INFO L480 AbstractCegarLoop]: Abstraction has 3086 states and 7702 transitions. [2018-12-09 06:13:09,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:13:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 7702 transitions. [2018-12-09 06:13:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 06:13:09,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:09,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:13:09,777 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:09,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:09,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1646805631, now seen corresponding path program 1 times [2018-12-09 06:13:09,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:09,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:09,858 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-09 06:13:09,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:09,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 06:13:09,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:09,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 06:13:09,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 06:13:09,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 06:13:09,858 INFO L87 Difference]: Start difference. First operand 3086 states and 7702 transitions. Second operand 10 states. [2018-12-09 06:13:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:10,119 INFO L93 Difference]: Finished difference Result 5201 states and 13167 transitions. [2018-12-09 06:13:10,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 06:13:10,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-09 06:13:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:10,121 INFO L225 Difference]: With dead ends: 5201 [2018-12-09 06:13:10,121 INFO L226 Difference]: Without dead ends: 2091 [2018-12-09 06:13:10,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 06:13:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2018-12-09 06:13:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2091. [2018-12-09 06:13:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2018-12-09 06:13:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 5397 transitions. [2018-12-09 06:13:10,134 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 5397 transitions. Word has length 96 [2018-12-09 06:13:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:10,134 INFO L480 AbstractCegarLoop]: Abstraction has 2091 states and 5397 transitions. [2018-12-09 06:13:10,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 06:13:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 5397 transitions. [2018-12-09 06:13:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 06:13:10,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:10,136 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-09 06:13:10,136 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:10,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1343180800, now seen corresponding path program 2 times [2018-12-09 06:13:10,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:10,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:13:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:10,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:10,178 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-09 06:13:10,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:10,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 06:13:10,178 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:10,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 06:13:10,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 06:13:10,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 06:13:10,179 INFO L87 Difference]: Start difference. First operand 2091 states and 5397 transitions. Second operand 5 states. [2018-12-09 06:13:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:10,199 INFO L93 Difference]: Finished difference Result 2091 states and 5387 transitions. [2018-12-09 06:13:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 06:13:10,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 06:13:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:10,201 INFO L225 Difference]: With dead ends: 2091 [2018-12-09 06:13:10,201 INFO L226 Difference]: Without dead ends: 2091 [2018-12-09 06:13:10,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 06:13:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2018-12-09 06:13:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2051. [2018-12-09 06:13:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-12-09 06:13:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 5303 transitions. [2018-12-09 06:13:10,214 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 5303 transitions. Word has length 96 [2018-12-09 06:13:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:10,215 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 5303 transitions. [2018-12-09 06:13:10,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 06:13:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 5303 transitions. [2018-12-09 06:13:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 06:13:10,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:10,216 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-09 06:13:10,216 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:10,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2018-12-09 06:13:10,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:10,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:13:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:10,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:13:10,288 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-09 06:13:10,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:13:10,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 06:13:10,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:13:10,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 06:13:10,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 06:13:10,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 06:13:10,289 INFO L87 Difference]: Start difference. First operand 2051 states and 5303 transitions. Second operand 12 states. [2018-12-09 06:13:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:13:10,645 INFO L93 Difference]: Finished difference Result 3882 states and 10151 transitions. [2018-12-09 06:13:10,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 06:13:10,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-09 06:13:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:13:10,647 INFO L225 Difference]: With dead ends: 3882 [2018-12-09 06:13:10,647 INFO L226 Difference]: Without dead ends: 2746 [2018-12-09 06:13:10,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 06:13:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2018-12-09 06:13:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2580. [2018-12-09 06:13:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2018-12-09 06:13:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6543 transitions. [2018-12-09 06:13:10,664 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6543 transitions. Word has length 96 [2018-12-09 06:13:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:13:10,665 INFO L480 AbstractCegarLoop]: Abstraction has 2580 states and 6543 transitions. [2018-12-09 06:13:10,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 06:13:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6543 transitions. [2018-12-09 06:13:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 06:13:10,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:13:10,666 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-09 06:13:10,666 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:13:10,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:13:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2018-12-09 06:13:10,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:13:10,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:10,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 06:13:10,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:13:10,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:13:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:13:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:13:10,701 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 06:13:10,785 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 06:13:10,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:13:10 BasicIcfg [2018-12-09 06:13:10,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 06:13:10,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 06:13:10,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 06:13:10,787 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 06:13:10,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:12:48" (3/4) ... [2018-12-09 06:13:10,790 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 06:13:10,877 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_85c51f68-01d8-4fd2-890e-4087b9c57883/bin-2019/utaipan/witness.graphml [2018-12-09 06:13:10,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 06:13:10,878 INFO L168 Benchmark]: Toolchain (without parser) took 23079.25 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 956.0 MB in the beginning and 1.6 GB in the end (delta: -675.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-09 06:13:10,879 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:13:10,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -104.2 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-09 06:13:10,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.61 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.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-09 06:13:10,880 INFO L168 Benchmark]: Boogie Preprocessor took 18.46 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-09 06:13:10,880 INFO L168 Benchmark]: RCFGBuilder took 336.05 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: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2018-12-09 06:13:10,881 INFO L168 Benchmark]: TraceAbstraction took 22211.50 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -674.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-09 06:13:10,881 INFO L168 Benchmark]: Witness Printer took 90.61 ms. Allocated memory is still 3.4 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2018-12-09 06:13:10,882 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -104.2 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.61 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.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.46 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 336.05 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: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22211.50 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -674.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 90.61 ms. Allocated memory is still 3.4 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_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] [L765] -1 pthread_t t1101; 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] [L766] FCALL, FORK -1 pthread_create(&t1101, ((void *)0), P0, ((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=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] [L767] -1 pthread_t t1102; 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=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] [L768] FCALL, FORK -1 pthread_create(&t1102, ((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=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] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 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}, 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=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 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 [L709] EXPR 1 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 0 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 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 [L750] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 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=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 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 [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 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=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 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 [L716] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -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) [L775] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -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 [L777] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 22.1s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8889 SDtfs, 9653 SDslu, 21113 SDs, 0 SdLazy, 10109 SolverSat, 517 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 96 SyntacticMatches, 22 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 171890 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2547 NumberOfCodeBlocks, 2547 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2419 ConstructedInterpolants, 0 QuantifiedInterpolants, 494089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...