./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/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 26b2b2357b814182a8d4879b997bcd0cb02065f5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:21:55,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:21:55,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:21:55,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:21:55,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:21:55,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:21:55,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:21:55,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:21:55,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:21:55,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:21:55,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:21:55,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:21:55,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:21:55,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:21:55,296 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:21:55,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:21:55,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:21:55,298 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:21:55,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:21:55,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:21:55,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:21:55,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:21:55,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:21:55,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:21:55,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:21:55,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:21:55,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:21:55,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:21:55,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:21:55,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:21:55,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:21:55,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:21:55,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:21:55,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:21:55,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:21:55,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:21:55,307 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 05:21:55,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:21:55,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:21:55,315 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:21:55,315 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:21:55,315 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:21:55,315 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:21:55,315 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:21:55,315 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 05:21:55,315 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:21:55,315 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:21:55,316 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 05:21:55,316 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 05:21:55,316 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:21:55,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:21:55,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:21:55,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:21:55,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:21:55,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:21:55,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:21:55,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:21:55,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:21:55,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:21:55,317 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:21:55,317 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:21:55,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:21:55,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:21:55,318 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:21:55,318 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:21:55,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:21:55,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:21:55,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:21:55,318 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:21:55,319 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 05:21:55,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:21:55,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:21:55,319 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 05:21:55,319 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_5b676749-9f2b-49ea-81d5-0398f10d034a/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 -> 26b2b2357b814182a8d4879b997bcd0cb02065f5 [2018-12-09 05:21:55,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:21:55,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:21:55,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:21:55,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:21:55,346 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:21:55,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i [2018-12-09 05:21:55,381 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/data/5d2f2459f/5a39341d31674798b16a3a630c40ca9b/FLAGaee0f27e0 [2018-12-09 05:21:55,890 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:21:55,890 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/sv-benchmarks/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i [2018-12-09 05:21:55,897 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/data/5d2f2459f/5a39341d31674798b16a3a630c40ca9b/FLAGaee0f27e0 [2018-12-09 05:21:55,905 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/data/5d2f2459f/5a39341d31674798b16a3a630c40ca9b [2018-12-09 05:21:55,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:21:55,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:21:55,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:21:55,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:21:55,911 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:21:55,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:21:55" (1/1) ... [2018-12-09 05:21:55,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:55, skipping insertion in model container [2018-12-09 05:21:55,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:21:55" (1/1) ... [2018-12-09 05:21:55,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:21:55,946 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:21:56,151 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:21:56,159 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:21:56,250 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:21:56,293 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:21:56,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56 WrapperNode [2018-12-09 05:21:56,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:21:56,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:21:56,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:21:56,294 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:21:56,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... [2018-12-09 05:21:56,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... [2018-12-09 05:21:56,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:21:56,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:21:56,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:21:56,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:21:56,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... [2018-12-09 05:21:56,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... [2018-12-09 05:21:56,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... [2018-12-09 05:21:56,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... [2018-12-09 05:21:56,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... [2018-12-09 05:21:56,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... [2018-12-09 05:21:56,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... [2018-12-09 05:21:56,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:21:56,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:21:56,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:21:56,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:21:56,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/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 05:21:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:21:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 05:21:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 05:21:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 05:21:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 05:21:56,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 05:21:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 05:21:56,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 05:21:56,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 05:21:56,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:21:56,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:21:56,388 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 05:21:56,688 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:21:56,688 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 05:21:56,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:21:56 BoogieIcfgContainer [2018-12-09 05:21:56,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:21:56,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:21:56,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:21:56,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:21:56,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:21:55" (1/3) ... [2018-12-09 05:21:56,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b19d554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:21:56, skipping insertion in model container [2018-12-09 05:21:56,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:21:56" (2/3) ... [2018-12-09 05:21:56,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b19d554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:21:56, skipping insertion in model container [2018-12-09 05:21:56,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:21:56" (3/3) ... [2018-12-09 05:21:56,693 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc_false-unreach-call.i [2018-12-09 05:21:56,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,715 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,716 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,716 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,716 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,716 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,720 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,721 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,721 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,721 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:21:56,730 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 05:21:56,731 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:21:56,736 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 05:21:56,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 05:21:56,761 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:21:56,761 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:21:56,761 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:21:56,762 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:21:56,762 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:21:56,762 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:21:56,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:21:56,762 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:21:56,769 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-12-09 05:21:57,839 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2018-12-09 05:21:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2018-12-09 05:21:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 05:21:57,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:21:57,845 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] [2018-12-09 05:21:57,847 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:21:57,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:21:57,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2018-12-09 05:21:57,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:21:57,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:21:57,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:21:57,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:21:57,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:21:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:21:57,981 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 05:21:57,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:21:57,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:21:57,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:21:57,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:21:57,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:21:57,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:21:57,995 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2018-12-09 05:21:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:21:58,327 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2018-12-09 05:21:58,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:21:58,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-09 05:21:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:21:58,471 INFO L225 Difference]: With dead ends: 45394 [2018-12-09 05:21:58,471 INFO L226 Difference]: Without dead ends: 40634 [2018-12-09 05:21:58,472 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 05:21:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2018-12-09 05:21:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2018-12-09 05:21:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2018-12-09 05:21:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2018-12-09 05:21:59,298 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2018-12-09 05:21:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:21:59,298 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2018-12-09 05:21:59,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:21:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2018-12-09 05:21:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 05:21:59,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:21:59,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:21:59,301 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:21:59,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:21:59,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2018-12-09 05:21:59,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:21:59,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:21:59,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:21:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:21:59,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:21:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:21:59,368 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 05:21:59,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:21:59,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:21:59,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:21:59,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:21:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:21:59,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:21:59,371 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2018-12-09 05:22:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:00,187 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2018-12-09 05:22:00,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:22:00,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-09 05:22:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:00,337 INFO L225 Difference]: With dead ends: 64836 [2018-12-09 05:22:00,337 INFO L226 Difference]: Without dead ends: 64676 [2018-12-09 05:22:00,337 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 05:22:00,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2018-12-09 05:22:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2018-12-09 05:22:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2018-12-09 05:22:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2018-12-09 05:22:01,207 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2018-12-09 05:22:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:01,208 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2018-12-09 05:22:01,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:22:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2018-12-09 05:22:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 05:22:01,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:01,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:01,211 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:01,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2018-12-09 05:22:01,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:01,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:01,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:01,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:01,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:01,253 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 05:22:01,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:01,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:22:01,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:01,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:22:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:22:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:22:01,255 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2018-12-09 05:22:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:01,303 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2018-12-09 05:22:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:22:01,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 05:22:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:01,321 INFO L225 Difference]: With dead ends: 12370 [2018-12-09 05:22:01,322 INFO L226 Difference]: Without dead ends: 11849 [2018-12-09 05:22:01,322 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 05:22:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2018-12-09 05:22:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2018-12-09 05:22:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2018-12-09 05:22:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2018-12-09 05:22:01,458 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2018-12-09 05:22:01,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:01,458 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2018-12-09 05:22:01,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:22:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2018-12-09 05:22:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 05:22:01,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:01,461 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] [2018-12-09 05:22:01,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:01,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:01,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2018-12-09 05:22:01,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:01,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:01,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:01,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:01,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:01,511 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 05:22:01,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:01,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:22:01,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:01,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:22:01,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:22:01,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:22:01,512 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2018-12-09 05:22:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:01,692 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2018-12-09 05:22:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:22:01,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 05:22:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:01,719 INFO L225 Difference]: With dead ends: 17025 [2018-12-09 05:22:01,719 INFO L226 Difference]: Without dead ends: 17025 [2018-12-09 05:22:01,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:22:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2018-12-09 05:22:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2018-12-09 05:22:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2018-12-09 05:22:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2018-12-09 05:22:01,932 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2018-12-09 05:22:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:01,932 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2018-12-09 05:22:01,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:22:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2018-12-09 05:22:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 05:22:01,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:01,937 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] [2018-12-09 05:22:01,937 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:01,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2018-12-09 05:22:01,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:01,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:01,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:01,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:01,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:02,018 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 05:22:02,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:02,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:22:02,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:02,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:22:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:22:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:22:02,019 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2018-12-09 05:22:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:02,477 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2018-12-09 05:22:02,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:22:02,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 05:22:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:02,499 INFO L225 Difference]: With dead ends: 18380 [2018-12-09 05:22:02,499 INFO L226 Difference]: Without dead ends: 18380 [2018-12-09 05:22:02,499 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 05:22:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-12-09 05:22:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2018-12-09 05:22:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2018-12-09 05:22:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2018-12-09 05:22:02,697 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2018-12-09 05:22:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:02,697 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2018-12-09 05:22:02,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:22:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2018-12-09 05:22:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 05:22:02,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:02,702 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] [2018-12-09 05:22:02,702 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:02,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2018-12-09 05:22:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:02,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:02,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:02,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:02,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:02,791 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 05:22:02,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:02,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:02,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:02,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:02,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:02,792 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2018-12-09 05:22:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:03,051 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2018-12-09 05:22:03,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:22:03,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 05:22:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:03,072 INFO L225 Difference]: With dead ends: 17857 [2018-12-09 05:22:03,073 INFO L226 Difference]: Without dead ends: 17857 [2018-12-09 05:22:03,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:22:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2018-12-09 05:22:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2018-12-09 05:22:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2018-12-09 05:22:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2018-12-09 05:22:03,263 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2018-12-09 05:22:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:03,263 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2018-12-09 05:22:03,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2018-12-09 05:22:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 05:22:03,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:03,268 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] [2018-12-09 05:22:03,268 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:03,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:03,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2018-12-09 05:22:03,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:03,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:03,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:03,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:03,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:03,327 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 05:22:03,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:03,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:03,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:03,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:03,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:03,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:03,328 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2018-12-09 05:22:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:03,652 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2018-12-09 05:22:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 05:22:03,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 05:22:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:03,680 INFO L225 Difference]: With dead ends: 23475 [2018-12-09 05:22:03,680 INFO L226 Difference]: Without dead ends: 23443 [2018-12-09 05:22:03,680 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 05:22:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2018-12-09 05:22:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2018-12-09 05:22:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2018-12-09 05:22:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2018-12-09 05:22:03,949 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2018-12-09 05:22:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:03,950 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2018-12-09 05:22:03,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2018-12-09 05:22:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 05:22:03,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:03,961 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] [2018-12-09 05:22:03,961 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:03,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:03,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2018-12-09 05:22:03,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:03,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:03,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:03,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:04,017 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 05:22:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:04,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:22:04,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:04,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:22:04,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:22:04,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:22:04,018 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2018-12-09 05:22:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:04,457 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2018-12-09 05:22:04,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 05:22:04,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-09 05:22:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:04,486 INFO L225 Difference]: With dead ends: 24535 [2018-12-09 05:22:04,487 INFO L226 Difference]: Without dead ends: 24471 [2018-12-09 05:22:04,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-09 05:22:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2018-12-09 05:22:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2018-12-09 05:22:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2018-12-09 05:22:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2018-12-09 05:22:04,731 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2018-12-09 05:22:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:04,731 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2018-12-09 05:22:04,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:22:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2018-12-09 05:22:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 05:22:04,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:04,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:04,745 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:04,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2018-12-09 05:22:04,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:04,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:04,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:04,766 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 05:22:04,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:04,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:22:04,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:04,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:22:04,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:22:04,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:22:04,767 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2018-12-09 05:22:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:04,877 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2018-12-09 05:22:04,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:22:04,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-09 05:22:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:04,909 INFO L225 Difference]: With dead ends: 24947 [2018-12-09 05:22:04,909 INFO L226 Difference]: Without dead ends: 24947 [2018-12-09 05:22:04,910 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 05:22:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2018-12-09 05:22:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2018-12-09 05:22:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2018-12-09 05:22:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2018-12-09 05:22:05,158 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2018-12-09 05:22:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:05,158 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2018-12-09 05:22:05,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:22:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2018-12-09 05:22:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 05:22:05,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:05,178 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] [2018-12-09 05:22:05,179 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:05,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2018-12-09 05:22:05,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:05,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:05,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:05,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:05,234 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 05:22:05,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:05,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:22:05,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:05,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:22:05,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:22:05,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:22:05,235 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2018-12-09 05:22:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:05,591 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2018-12-09 05:22:05,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:22:05,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 05:22:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:05,634 INFO L225 Difference]: With dead ends: 34667 [2018-12-09 05:22:05,634 INFO L226 Difference]: Without dead ends: 34471 [2018-12-09 05:22:05,634 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 05:22:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2018-12-09 05:22:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2018-12-09 05:22:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2018-12-09 05:22:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2018-12-09 05:22:06,141 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2018-12-09 05:22:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:06,142 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2018-12-09 05:22:06,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:22:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2018-12-09 05:22:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 05:22:06,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:06,159 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] [2018-12-09 05:22:06,159 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:06,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:06,160 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2018-12-09 05:22:06,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:06,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:06,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:06,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:06,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:06,237 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 05:22:06,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:06,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:06,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:06,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:06,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:06,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:06,238 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2018-12-09 05:22:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:06,695 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2018-12-09 05:22:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 05:22:06,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-12-09 05:22:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:06,768 INFO L225 Difference]: With dead ends: 52152 [2018-12-09 05:22:06,768 INFO L226 Difference]: Without dead ends: 51912 [2018-12-09 05:22:06,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:22:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2018-12-09 05:22:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2018-12-09 05:22:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2018-12-09 05:22:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2018-12-09 05:22:07,302 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2018-12-09 05:22:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:07,302 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2018-12-09 05:22:07,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2018-12-09 05:22:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 05:22:07,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:07,332 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] [2018-12-09 05:22:07,332 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:07,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2018-12-09 05:22:07,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:07,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:07,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:07,371 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 05:22:07,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:07,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:22:07,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:07,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:22:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:22:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:22:07,372 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2018-12-09 05:22:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:07,413 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2018-12-09 05:22:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:22:07,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-09 05:22:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:07,419 INFO L225 Difference]: With dead ends: 5456 [2018-12-09 05:22:07,419 INFO L226 Difference]: Without dead ends: 4832 [2018-12-09 05:22:07,419 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 05:22:07,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2018-12-09 05:22:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2018-12-09 05:22:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2018-12-09 05:22:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2018-12-09 05:22:07,461 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2018-12-09 05:22:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:07,461 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2018-12-09 05:22:07,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:22:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2018-12-09 05:22:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 05:22:07,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:07,465 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] [2018-12-09 05:22:07,465 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:07,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:07,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1415378869, now seen corresponding path program 1 times [2018-12-09 05:22:07,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:07,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:07,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:07,514 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 05:22:07,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:07,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:22:07,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:07,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:22:07,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:22:07,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:22:07,515 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2018-12-09 05:22:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:07,631 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2018-12-09 05:22:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:22:07,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-09 05:22:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:07,635 INFO L225 Difference]: With dead ends: 5468 [2018-12-09 05:22:07,635 INFO L226 Difference]: Without dead ends: 5440 [2018-12-09 05:22:07,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:22:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-12-09 05:22:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2018-12-09 05:22:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2018-12-09 05:22:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2018-12-09 05:22:07,672 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2018-12-09 05:22:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:07,672 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2018-12-09 05:22:07,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:22:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2018-12-09 05:22:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 05:22:07,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:07,676 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] [2018-12-09 05:22:07,676 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:07,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash -282188276, now seen corresponding path program 1 times [2018-12-09 05:22:07,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:07,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:07,700 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 05:22:07,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:07,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:22:07,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:07,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:22:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:22:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:22:07,701 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2018-12-09 05:22:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:07,772 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2018-12-09 05:22:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:22:07,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-09 05:22:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:07,776 INFO L225 Difference]: With dead ends: 5440 [2018-12-09 05:22:07,776 INFO L226 Difference]: Without dead ends: 5440 [2018-12-09 05:22:07,776 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 05:22:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-12-09 05:22:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2018-12-09 05:22:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2018-12-09 05:22:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2018-12-09 05:22:07,813 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2018-12-09 05:22:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:07,813 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2018-12-09 05:22:07,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:22:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2018-12-09 05:22:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 05:22:07,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:07,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:07,817 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:07,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash -827167888, now seen corresponding path program 1 times [2018-12-09 05:22:07,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:07,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:07,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:07,839 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 05:22:07,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:07,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:22:07,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:07,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:22:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:22:07,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:22:07,839 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 4 states. [2018-12-09 05:22:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:07,920 INFO L93 Difference]: Finished difference Result 9734 states and 25760 transitions. [2018-12-09 05:22:07,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:22:07,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 05:22:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:07,928 INFO L225 Difference]: With dead ends: 9734 [2018-12-09 05:22:07,928 INFO L226 Difference]: Without dead ends: 9706 [2018-12-09 05:22:07,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:22:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2018-12-09 05:22:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 5140. [2018-12-09 05:22:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2018-12-09 05:22:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13376 transitions. [2018-12-09 05:22:07,981 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13376 transitions. Word has length 91 [2018-12-09 05:22:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:07,981 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13376 transitions. [2018-12-09 05:22:07,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:22:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13376 transitions. [2018-12-09 05:22:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 05:22:07,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:07,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:07,984 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:07,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1904621007, now seen corresponding path program 1 times [2018-12-09 05:22:07,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:07,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:07,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:07,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:08,041 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 05:22:08,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:08,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:08,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:08,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:08,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:08,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:08,042 INFO L87 Difference]: Start difference. First operand 5140 states and 13376 transitions. Second operand 6 states. [2018-12-09 05:22:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:08,225 INFO L93 Difference]: Finished difference Result 5643 states and 14543 transitions. [2018-12-09 05:22:08,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:22:08,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 05:22:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:08,229 INFO L225 Difference]: With dead ends: 5643 [2018-12-09 05:22:08,229 INFO L226 Difference]: Without dead ends: 5643 [2018-12-09 05:22:08,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2018-12-09 05:22:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5222. [2018-12-09 05:22:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2018-12-09 05:22:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 13576 transitions. [2018-12-09 05:22:08,265 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 13576 transitions. Word has length 91 [2018-12-09 05:22:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:08,265 INFO L480 AbstractCegarLoop]: Abstraction has 5222 states and 13576 transitions. [2018-12-09 05:22:08,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 13576 transitions. [2018-12-09 05:22:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 05:22:08,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:08,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:08,268 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:08,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:08,269 INFO L82 PathProgramCache]: Analyzing trace with hash -935039984, now seen corresponding path program 1 times [2018-12-09 05:22:08,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:08,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:08,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:08,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:08,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:08,355 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 05:22:08,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:08,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:22:08,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:08,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:22:08,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:22:08,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:22:08,356 INFO L87 Difference]: Start difference. First operand 5222 states and 13576 transitions. Second operand 7 states. [2018-12-09 05:22:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:08,575 INFO L93 Difference]: Finished difference Result 5203 states and 13406 transitions. [2018-12-09 05:22:08,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 05:22:08,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 05:22:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:08,580 INFO L225 Difference]: With dead ends: 5203 [2018-12-09 05:22:08,580 INFO L226 Difference]: Without dead ends: 5178 [2018-12-09 05:22:08,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:22:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2018-12-09 05:22:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4801. [2018-12-09 05:22:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2018-12-09 05:22:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 12542 transitions. [2018-12-09 05:22:08,619 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 12542 transitions. Word has length 91 [2018-12-09 05:22:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:08,620 INFO L480 AbstractCegarLoop]: Abstraction has 4801 states and 12542 transitions. [2018-12-09 05:22:08,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:22:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 12542 transitions. [2018-12-09 05:22:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 05:22:08,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:08,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:08,623 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:08,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:08,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1383736623, now seen corresponding path program 1 times [2018-12-09 05:22:08,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:08,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:08,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:08,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:08,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:08,684 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 05:22:08,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:08,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:08,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:08,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:08,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:08,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:08,685 INFO L87 Difference]: Start difference. First operand 4801 states and 12542 transitions. Second operand 6 states. [2018-12-09 05:22:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:08,823 INFO L93 Difference]: Finished difference Result 4393 states and 11483 transitions. [2018-12-09 05:22:08,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:22:08,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 05:22:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:08,827 INFO L225 Difference]: With dead ends: 4393 [2018-12-09 05:22:08,827 INFO L226 Difference]: Without dead ends: 4393 [2018-12-09 05:22:08,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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 05:22:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2018-12-09 05:22:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4259. [2018-12-09 05:22:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4259 states. [2018-12-09 05:22:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 11187 transitions. [2018-12-09 05:22:08,858 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 11187 transitions. Word has length 91 [2018-12-09 05:22:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:08,859 INFO L480 AbstractCegarLoop]: Abstraction has 4259 states and 11187 transitions. [2018-12-09 05:22:08,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 11187 transitions. [2018-12-09 05:22:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 05:22:08,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22: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] [2018-12-09 05:22:08,862 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:08,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash -82841607, now seen corresponding path program 1 times [2018-12-09 05:22:08,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:08,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:08,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:08,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:08,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:08,931 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 05:22:08,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:08,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:08,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:08,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:08,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:08,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:08,932 INFO L87 Difference]: Start difference. First operand 4259 states and 11187 transitions. Second operand 6 states. [2018-12-09 05:22:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:09,087 INFO L93 Difference]: Finished difference Result 5737 states and 14773 transitions. [2018-12-09 05:22:09,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:22:09,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 05:22:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:09,092 INFO L225 Difference]: With dead ends: 5737 [2018-12-09 05:22:09,092 INFO L226 Difference]: Without dead ends: 5705 [2018-12-09 05:22:09,093 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 05:22:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2018-12-09 05:22:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 4600. [2018-12-09 05:22:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4600 states. [2018-12-09 05:22:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 11989 transitions. [2018-12-09 05:22:09,131 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 11989 transitions. Word has length 91 [2018-12-09 05:22:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:09,131 INFO L480 AbstractCegarLoop]: Abstraction has 4600 states and 11989 transitions. [2018-12-09 05:22:09,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 11989 transitions. [2018-12-09 05:22:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 05:22:09,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:09,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:09,134 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:09,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:09,134 INFO L82 PathProgramCache]: Analyzing trace with hash -365992071, now seen corresponding path program 1 times [2018-12-09 05:22:09,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:09,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:09,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:09,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:09,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:09,207 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 05:22:09,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:09,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:22:09,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:09,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:22:09,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:22:09,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:22:09,208 INFO L87 Difference]: Start difference. First operand 4600 states and 11989 transitions. Second operand 7 states. [2018-12-09 05:22:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:09,428 INFO L93 Difference]: Finished difference Result 8360 states and 22331 transitions. [2018-12-09 05:22:09,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 05:22:09,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 05:22:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:09,434 INFO L225 Difference]: With dead ends: 8360 [2018-12-09 05:22:09,435 INFO L226 Difference]: Without dead ends: 8360 [2018-12-09 05:22:09,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:22:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8360 states. [2018-12-09 05:22:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8360 to 5036. [2018-12-09 05:22:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5036 states. [2018-12-09 05:22:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 13135 transitions. [2018-12-09 05:22:09,483 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 13135 transitions. Word has length 91 [2018-12-09 05:22:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:09,483 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 13135 transitions. [2018-12-09 05:22:09,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:22:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 13135 transitions. [2018-12-09 05:22:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 05:22:09,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:09,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:09,486 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:09,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash 878772410, now seen corresponding path program 1 times [2018-12-09 05:22:09,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:09,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:09,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:09,536 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 05:22:09,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:09,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:09,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:09,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:09,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:09,537 INFO L87 Difference]: Start difference. First operand 5036 states and 13135 transitions. Second operand 6 states. [2018-12-09 05:22:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:09,587 INFO L93 Difference]: Finished difference Result 7806 states and 20863 transitions. [2018-12-09 05:22:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:22:09,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 05:22:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:09,596 INFO L225 Difference]: With dead ends: 7806 [2018-12-09 05:22:09,596 INFO L226 Difference]: Without dead ends: 7806 [2018-12-09 05:22:09,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states. [2018-12-09 05:22:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 4716. [2018-12-09 05:22:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2018-12-09 05:22:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 12277 transitions. [2018-12-09 05:22:09,647 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 12277 transitions. Word has length 91 [2018-12-09 05:22:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:09,647 INFO L480 AbstractCegarLoop]: Abstraction has 4716 states and 12277 transitions. [2018-12-09 05:22:09,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 12277 transitions. [2018-12-09 05:22:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 05:22:09,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:09,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:09,650 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:09,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:09,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1359488826, now seen corresponding path program 1 times [2018-12-09 05:22:09,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:09,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:09,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:09,725 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 05:22:09,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:09,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:09,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:09,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:09,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:09,726 INFO L87 Difference]: Start difference. First operand 4716 states and 12277 transitions. Second operand 6 states. [2018-12-09 05:22:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:09,841 INFO L93 Difference]: Finished difference Result 4076 states and 10405 transitions. [2018-12-09 05:22:09,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:22:09,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 05:22:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:09,845 INFO L225 Difference]: With dead ends: 4076 [2018-12-09 05:22:09,845 INFO L226 Difference]: Without dead ends: 4076 [2018-12-09 05:22:09,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:22:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2018-12-09 05:22:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3489. [2018-12-09 05:22:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2018-12-09 05:22:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 9041 transitions. [2018-12-09 05:22:09,873 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 9041 transitions. Word has length 91 [2018-12-09 05:22:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:09,873 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 9041 transitions. [2018-12-09 05:22:09,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 9041 transitions. [2018-12-09 05:22:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:22:09,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:09,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:09,875 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:09,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:09,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1413527866, now seen corresponding path program 1 times [2018-12-09 05:22:09,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:09,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:09,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:09,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:09,921 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 05:22:09,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:09,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:09,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:09,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:09,923 INFO L87 Difference]: Start difference. First operand 3489 states and 9041 transitions. Second operand 6 states. [2018-12-09 05:22:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:10,109 INFO L93 Difference]: Finished difference Result 3702 states and 9446 transitions. [2018-12-09 05:22:10,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:22:10,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 05:22:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:10,112 INFO L225 Difference]: With dead ends: 3702 [2018-12-09 05:22:10,112 INFO L226 Difference]: Without dead ends: 3657 [2018-12-09 05:22:10,112 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 05:22:10,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2018-12-09 05:22:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3597. [2018-12-09 05:22:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-09 05:22:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9246 transitions. [2018-12-09 05:22:10,137 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9246 transitions. Word has length 93 [2018-12-09 05:22:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:10,137 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9246 transitions. [2018-12-09 05:22:10,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9246 transitions. [2018-12-09 05:22:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:22:10,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:10,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:10,139 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:10,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:10,140 INFO L82 PathProgramCache]: Analyzing trace with hash -522132421, now seen corresponding path program 1 times [2018-12-09 05:22:10,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:10,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:10,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:10,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:10,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:10,181 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 05:22:10,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:10,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:22:10,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:10,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:22:10,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:22:10,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:22:10,182 INFO L87 Difference]: Start difference. First operand 3597 states and 9246 transitions. Second operand 7 states. [2018-12-09 05:22:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:10,425 INFO L93 Difference]: Finished difference Result 5508 states and 13847 transitions. [2018-12-09 05:22:10,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 05:22:10,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 05:22:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:10,429 INFO L225 Difference]: With dead ends: 5508 [2018-12-09 05:22:10,429 INFO L226 Difference]: Without dead ends: 5476 [2018-12-09 05:22:10,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-09 05:22:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2018-12-09 05:22:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 4226. [2018-12-09 05:22:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4226 states. [2018-12-09 05:22:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 10779 transitions. [2018-12-09 05:22:10,465 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 10779 transitions. Word has length 93 [2018-12-09 05:22:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:10,465 INFO L480 AbstractCegarLoop]: Abstraction has 4226 states and 10779 transitions. [2018-12-09 05:22:10,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:22:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 10779 transitions. [2018-12-09 05:22:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:22:10,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:10,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:10,468 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:10,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:10,468 INFO L82 PathProgramCache]: Analyzing trace with hash 722632060, now seen corresponding path program 1 times [2018-12-09 05:22:10,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:10,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:10,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:10,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:10,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:10,520 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 05:22:10,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:10,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:22:10,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:10,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:22:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:22:10,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:22:10,521 INFO L87 Difference]: Start difference. First operand 4226 states and 10779 transitions. Second operand 6 states. [2018-12-09 05:22:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:10,591 INFO L93 Difference]: Finished difference Result 4301 states and 10863 transitions. [2018-12-09 05:22:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:22:10,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 05:22:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:10,594 INFO L225 Difference]: With dead ends: 4301 [2018-12-09 05:22:10,595 INFO L226 Difference]: Without dead ends: 4301 [2018-12-09 05:22:10,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:22:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2018-12-09 05:22:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4171. [2018-12-09 05:22:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2018-12-09 05:22:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 10618 transitions. [2018-12-09 05:22:10,625 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 10618 transitions. Word has length 93 [2018-12-09 05:22:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:10,625 INFO L480 AbstractCegarLoop]: Abstraction has 4171 states and 10618 transitions. [2018-12-09 05:22:10,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:22:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 10618 transitions. [2018-12-09 05:22:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:22:10,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:10,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:10,627 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:10,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash -192366660, now seen corresponding path program 1 times [2018-12-09 05:22:10,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:10,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:10,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:10,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:10,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:10,662 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 05:22:10,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:10,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:22:10,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:10,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:22:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:22:10,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:22:10,664 INFO L87 Difference]: Start difference. First operand 4171 states and 10618 transitions. Second operand 5 states. [2018-12-09 05:22:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:10,804 INFO L93 Difference]: Finished difference Result 4715 states and 11962 transitions. [2018-12-09 05:22:10,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:22:10,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 05:22:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:10,809 INFO L225 Difference]: With dead ends: 4715 [2018-12-09 05:22:10,809 INFO L226 Difference]: Without dead ends: 4683 [2018-12-09 05:22:10,810 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 05:22:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2018-12-09 05:22:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 3650. [2018-12-09 05:22:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3650 states. [2018-12-09 05:22:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 9341 transitions. [2018-12-09 05:22:10,852 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 9341 transitions. Word has length 93 [2018-12-09 05:22:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:10,852 INFO L480 AbstractCegarLoop]: Abstraction has 3650 states and 9341 transitions. [2018-12-09 05:22:10,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:22:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 9341 transitions. [2018-12-09 05:22:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:22:10,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:10,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:10,855 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:10,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1052397821, now seen corresponding path program 1 times [2018-12-09 05:22:10,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:10,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:10,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:10,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:10,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:10,931 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 05:22:10,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:10,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:22:10,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:10,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:22:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:22:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:22:10,932 INFO L87 Difference]: Start difference. First operand 3650 states and 9341 transitions. Second operand 7 states. [2018-12-09 05:22:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:11,095 INFO L93 Difference]: Finished difference Result 5475 states and 14168 transitions. [2018-12-09 05:22:11,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:22:11,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 05:22:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:11,097 INFO L225 Difference]: With dead ends: 5475 [2018-12-09 05:22:11,097 INFO L226 Difference]: Without dead ends: 1974 [2018-12-09 05:22:11,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:22:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2018-12-09 05:22:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2018-12-09 05:22:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-12-09 05:22:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 5105 transitions. [2018-12-09 05:22:11,110 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 5105 transitions. Word has length 93 [2018-12-09 05:22:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:11,110 INFO L480 AbstractCegarLoop]: Abstraction has 1974 states and 5105 transitions. [2018-12-09 05:22:11,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:22:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 5105 transitions. [2018-12-09 05:22:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:22:11,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:11,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:11,111 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:11,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:11,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1073077806, now seen corresponding path program 1 times [2018-12-09 05:22:11,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:11,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:11,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:11,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:11,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:11,157 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 05:22:11,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:11,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:22:11,157 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:11,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:22:11,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:22:11,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:22:11,158 INFO L87 Difference]: Start difference. First operand 1974 states and 5105 transitions. Second operand 7 states. [2018-12-09 05:22:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:11,238 INFO L93 Difference]: Finished difference Result 1988 states and 5137 transitions. [2018-12-09 05:22:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:22:11,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 05:22:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:11,240 INFO L225 Difference]: With dead ends: 1988 [2018-12-09 05:22:11,240 INFO L226 Difference]: Without dead ends: 1988 [2018-12-09 05:22:11,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 05:22:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-12-09 05:22:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1950. [2018-12-09 05:22:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2018-12-09 05:22:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5057 transitions. [2018-12-09 05:22:11,253 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5057 transitions. Word has length 93 [2018-12-09 05:22:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:11,253 INFO L480 AbstractCegarLoop]: Abstraction has 1950 states and 5057 transitions. [2018-12-09 05:22:11,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:22:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5057 transitions. [2018-12-09 05:22:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:22:11,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:11,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:11,255 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:11,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1021200916, now seen corresponding path program 2 times [2018-12-09 05:22:11,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:11,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:11,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:11,326 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 05:22:11,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:11,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 05:22:11,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:11,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 05:22:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 05:22:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:22:11,326 INFO L87 Difference]: Start difference. First operand 1950 states and 5057 transitions. Second operand 8 states. [2018-12-09 05:22:11,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:11,548 INFO L93 Difference]: Finished difference Result 2282 states and 5776 transitions. [2018-12-09 05:22:11,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 05:22:11,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-09 05:22:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:11,551 INFO L225 Difference]: With dead ends: 2282 [2018-12-09 05:22:11,551 INFO L226 Difference]: Without dead ends: 2253 [2018-12-09 05:22:11,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-09 05:22:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2018-12-09 05:22:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1942. [2018-12-09 05:22:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2018-12-09 05:22:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 5031 transitions. [2018-12-09 05:22:11,565 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 5031 transitions. Word has length 93 [2018-12-09 05:22:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:11,565 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 5031 transitions. [2018-12-09 05:22:11,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 05:22:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 5031 transitions. [2018-12-09 05:22:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:22:11,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:11,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:11,567 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:11,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1338106093, now seen corresponding path program 2 times [2018-12-09 05:22:11,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:11,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:22:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:11,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:11,650 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 05:22:11,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:11,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 05:22:11,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:22:11,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 05:22:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 05:22:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:22:11,652 INFO L87 Difference]: Start difference. First operand 1942 states and 5031 transitions. Second operand 12 states. [2018-12-09 05:22:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:11,950 INFO L93 Difference]: Finished difference Result 3699 states and 9678 transitions. [2018-12-09 05:22:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 05:22:11,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-09 05:22:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:11,952 INFO L225 Difference]: With dead ends: 3699 [2018-12-09 05:22:11,952 INFO L226 Difference]: Without dead ends: 2563 [2018-12-09 05:22:11,952 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 05:22:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2018-12-09 05:22:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2411. [2018-12-09 05:22:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-12-09 05:22:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6104 transitions. [2018-12-09 05:22:11,968 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6104 transitions. Word has length 93 [2018-12-09 05:22:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:11,968 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 6104 transitions. [2018-12-09 05:22:11,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 05:22:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6104 transitions. [2018-12-09 05:22:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:22:11,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:11,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:22:11,970 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:11,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:11,970 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2018-12-09 05:22:11,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:22:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:11,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:22:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:11,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:22:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:22:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:22:12,007 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:22:12,073 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 05:22:12,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:22:12 BasicIcfg [2018-12-09 05:22:12,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:22:12,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:22:12,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:22:12,075 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:22:12,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:21:56" (3/4) ... [2018-12-09 05:22:12,076 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 05:22:12,151 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5b676749-9f2b-49ea-81d5-0398f10d034a/bin-2019/utaipan/witness.graphml [2018-12-09 05:22:12,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:22:12,152 INFO L168 Benchmark]: Toolchain (without parser) took 16244.75 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 948.1 MB in the beginning and 722.0 MB in the end (delta: 226.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-09 05:22:12,153 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:22:12,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:22:12,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:22:12,154 INFO L168 Benchmark]: Boogie Preprocessor took 19.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:22:12,154 INFO L168 Benchmark]: RCFGBuilder took 332.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:22:12,154 INFO L168 Benchmark]: TraceAbstraction took 15385.28 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 757.9 MB in the end (delta: 305.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-09 05:22:12,154 INFO L168 Benchmark]: Witness Printer took 77.22 ms. Allocated memory is still 2.8 GB. Free memory was 757.9 MB in the beginning and 722.0 MB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:22:12,155 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 332.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15385.28 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 757.9 MB in the end (delta: 305.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 77.22 ms. Allocated memory is still 2.8 GB. Free memory was 757.9 MB in the beginning and 722.0 MB in the end (delta: 35.9 MB). Peak memory consumption was 35.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] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] -1 pthread_t t2479; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] FCALL, FORK -1 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2480; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L774] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L775] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L776] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 15.3s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7076 SDtfs, 6292 SDslu, 16018 SDs, 0 SdLazy, 6614 SolverSat, 377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 86 SyntacticMatches, 16 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 92793 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2453 NumberOfCodeBlocks, 2453 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2330 ConstructedInterpolants, 0 QuantifiedInterpolants, 459554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...