./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/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 98be72c950df5c9f21ba93d5244e9546239a88fe ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 17:20:26,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:20:26,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:20:26,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:20:26,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:20:26,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:20:26,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:20:26,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:20:26,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:20:26,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:20:26,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:20:26,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:20:26,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:20:26,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:20:26,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:20:26,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:20:26,032 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:20:26,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:20:26,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:20:26,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:20:26,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:20:26,037 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:20:26,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:20:26,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:20:26,039 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:20:26,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:20:26,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:20:26,041 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:20:26,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:20:26,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:20:26,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:20:26,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:20:26,043 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:20:26,043 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:20:26,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:20:26,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:20:26,044 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 17:20:26,054 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:20:26,054 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:20:26,055 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:20:26,055 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:20:26,055 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:20:26,056 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:20:26,056 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:20:26,056 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:20:26,056 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:20:26,056 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:20:26,056 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:20:26,056 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:20:26,056 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:20:26,057 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:20:26,057 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:20:26,057 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:20:26,057 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:20:26,057 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:20:26,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:20:26,058 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:20:26,058 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:20:26,058 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:20:26,058 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:20:26,058 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:20:26,058 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:20:26,058 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:20:26,058 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:20:26,059 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:20:26,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:20:26,059 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:20:26,059 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:20:26,059 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:20:26,059 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:20:26,059 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:20:26,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:20:26,059 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 17:20:26,059 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_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/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 -> 98be72c950df5c9f21ba93d5244e9546239a88fe [2018-12-08 17:20:26,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:20:26,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:20:26,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:20:26,092 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:20:26,092 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:20:26,093 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_false-unreach-call.i [2018-12-08 17:20:26,128 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/data/5030cf3f6/7bf433935a5b4382ae24e4c7aa8cde8f/FLAG304443b36 [2018-12-08 17:20:26,440 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:20:26,441 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_false-unreach-call.i [2018-12-08 17:20:26,448 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/data/5030cf3f6/7bf433935a5b4382ae24e4c7aa8cde8f/FLAG304443b36 [2018-12-08 17:20:26,456 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/data/5030cf3f6/7bf433935a5b4382ae24e4c7aa8cde8f [2018-12-08 17:20:26,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:20:26,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:20:26,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:20:26,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:20:26,461 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:20:26,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26, skipping insertion in model container [2018-12-08 17:20:26,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:20:26,488 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:20:26,663 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:20:26,671 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:20:26,752 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:20:26,782 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:20:26,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26 WrapperNode [2018-12-08 17:20:26,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:20:26,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:20:26,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:20:26,783 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:20:26,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:20:26,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:20:26,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:20:26,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:20:26,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... [2018-12-08 17:20:26,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:20:26,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:20:26,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:20:26,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:20:26,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/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-08 17:20:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:20:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:20:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 17:20:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:20:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 17:20:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 17:20:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 17:20:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 17:20:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 17:20:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:20:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:20:26,876 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 17:20:27,216 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:20:27,217 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 17:20:27,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:20:27 BoogieIcfgContainer [2018-12-08 17:20:27,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:20:27,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:20:27,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:20:27,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:20:27,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:20:26" (1/3) ... [2018-12-08 17:20:27,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4409b022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:20:27, skipping insertion in model container [2018-12-08 17:20:27,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:20:26" (2/3) ... [2018-12-08 17:20:27,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4409b022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:20:27, skipping insertion in model container [2018-12-08 17:20:27,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:20:27" (3/3) ... [2018-12-08 17:20:27,221 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_false-unreach-call.i [2018-12-08 17:20:27,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,244 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,244 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,247 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,247 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,247 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:20:27,255 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 17:20:27,255 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:20:27,262 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 17:20:27,273 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 17:20:27,288 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:20:27,288 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:20:27,288 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:20:27,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:20:27,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:20:27,288 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:20:27,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:20:27,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:20:27,298 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-08 17:20:28,364 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25087 states. [2018-12-08 17:20:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states. [2018-12-08 17:20:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 17:20:28,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:28,372 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] [2018-12-08 17:20:28,374 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:28,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:28,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1104590460, now seen corresponding path program 1 times [2018-12-08 17:20:28,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:28,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:28,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:20:28,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:28,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:20:28,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:28,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:20:28,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:20:28,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:20:28,544 INFO L87 Difference]: Start difference. First operand 25087 states. Second operand 4 states. [2018-12-08 17:20:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:28,887 INFO L93 Difference]: Finished difference Result 45387 states and 177625 transitions. [2018-12-08 17:20:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:20:28,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-08 17:20:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:29,043 INFO L225 Difference]: With dead ends: 45387 [2018-12-08 17:20:29,043 INFO L226 Difference]: Without dead ends: 40627 [2018-12-08 17:20:29,044 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-08 17:20:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40627 states. [2018-12-08 17:20:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40627 to 23661. [2018-12-08 17:20:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23661 states. [2018-12-08 17:20:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23661 states to 23661 states and 92542 transitions. [2018-12-08 17:20:29,722 INFO L78 Accepts]: Start accepts. Automaton has 23661 states and 92542 transitions. Word has length 36 [2018-12-08 17:20:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:29,723 INFO L480 AbstractCegarLoop]: Abstraction has 23661 states and 92542 transitions. [2018-12-08 17:20:29,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:20:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 23661 states and 92542 transitions. [2018-12-08 17:20:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 17:20:29,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:29,725 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-08 17:20:29,726 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:29,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:29,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1826409231, now seen corresponding path program 1 times [2018-12-08 17:20:29,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:29,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:29,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:29,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:29,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:29,770 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-08 17:20:29,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:29,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:20:29,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:29,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:20:29,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:20:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:20:29,772 INFO L87 Difference]: Start difference. First operand 23661 states and 92542 transitions. Second operand 5 states. [2018-12-08 17:20:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:30,366 INFO L93 Difference]: Finished difference Result 64829 states and 241368 transitions. [2018-12-08 17:20:30,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:20:30,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-08 17:20:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:30,500 INFO L225 Difference]: With dead ends: 64829 [2018-12-08 17:20:30,501 INFO L226 Difference]: Without dead ends: 64669 [2018-12-08 17:20:30,501 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-08 17:20:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2018-12-08 17:20:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 37141. [2018-12-08 17:20:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37141 states. [2018-12-08 17:20:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37141 states to 37141 states and 138283 transitions. [2018-12-08 17:20:31,272 INFO L78 Accepts]: Start accepts. Automaton has 37141 states and 138283 transitions. Word has length 43 [2018-12-08 17:20:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:31,273 INFO L480 AbstractCegarLoop]: Abstraction has 37141 states and 138283 transitions. [2018-12-08 17:20:31,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:20:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 37141 states and 138283 transitions. [2018-12-08 17:20:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 17:20:31,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:31,276 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] [2018-12-08 17:20:31,276 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:31,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:31,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1003362560, now seen corresponding path program 1 times [2018-12-08 17:20:31,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:31,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:31,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:31,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:31,314 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-08 17:20:31,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:31,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:20:31,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:31,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:20:31,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:20:31,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:20:31,315 INFO L87 Difference]: Start difference. First operand 37141 states and 138283 transitions. Second operand 4 states. [2018-12-08 17:20:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:31,357 INFO L93 Difference]: Finished difference Result 12363 states and 41176 transitions. [2018-12-08 17:20:31,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:20:31,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-08 17:20:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:31,373 INFO L225 Difference]: With dead ends: 12363 [2018-12-08 17:20:31,373 INFO L226 Difference]: Without dead ends: 11842 [2018-12-08 17:20:31,373 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-08 17:20:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2018-12-08 17:20:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 11842. [2018-12-08 17:20:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2018-12-08 17:20:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 39621 transitions. [2018-12-08 17:20:31,498 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 39621 transitions. Word has length 44 [2018-12-08 17:20:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:31,499 INFO L480 AbstractCegarLoop]: Abstraction has 11842 states and 39621 transitions. [2018-12-08 17:20:31,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:20:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 39621 transitions. [2018-12-08 17:20:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 17:20:31,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:31,502 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] [2018-12-08 17:20:31,502 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:31,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash 77217480, now seen corresponding path program 1 times [2018-12-08 17:20:31,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:31,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:31,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:20:31,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:31,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:20:31,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:31,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:20:31,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:20:31,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:20:31,557 INFO L87 Difference]: Start difference. First operand 11842 states and 39621 transitions. Second operand 4 states. [2018-12-08 17:20:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:31,726 INFO L93 Difference]: Finished difference Result 17018 states and 55692 transitions. [2018-12-08 17:20:31,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:20:31,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-08 17:20:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:31,748 INFO L225 Difference]: With dead ends: 17018 [2018-12-08 17:20:31,748 INFO L226 Difference]: Without dead ends: 17018 [2018-12-08 17:20:31,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:20:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2018-12-08 17:20:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 12878. [2018-12-08 17:20:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2018-12-08 17:20:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 42719 transitions. [2018-12-08 17:20:31,953 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 42719 transitions. Word has length 57 [2018-12-08 17:20:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:31,954 INFO L480 AbstractCegarLoop]: Abstraction has 12878 states and 42719 transitions. [2018-12-08 17:20:31,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:20:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 42719 transitions. [2018-12-08 17:20:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 17:20:31,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:31,958 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] [2018-12-08 17:20:31,958 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash -257181528, now seen corresponding path program 1 times [2018-12-08 17:20:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:31,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:31,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:32,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-08 17:20:32,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:32,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:20:32,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:32,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:20:32,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:20:32,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:20:32,020 INFO L87 Difference]: Start difference. First operand 12878 states and 42719 transitions. Second operand 5 states. [2018-12-08 17:20:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:32,045 INFO L93 Difference]: Finished difference Result 2522 states and 6736 transitions. [2018-12-08 17:20:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:20:32,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-08 17:20:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:32,048 INFO L225 Difference]: With dead ends: 2522 [2018-12-08 17:20:32,048 INFO L226 Difference]: Without dead ends: 2110 [2018-12-08 17:20:32,048 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-08 17:20:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2018-12-08 17:20:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2007. [2018-12-08 17:20:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2018-12-08 17:20:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 5339 transitions. [2018-12-08 17:20:32,117 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 5339 transitions. Word has length 57 [2018-12-08 17:20:32,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:32,117 INFO L480 AbstractCegarLoop]: Abstraction has 2007 states and 5339 transitions. [2018-12-08 17:20:32,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:20:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 5339 transitions. [2018-12-08 17:20:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 17:20:32,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:32,119 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] [2018-12-08 17:20:32,119 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:32,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:32,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1229710074, now seen corresponding path program 1 times [2018-12-08 17:20:32,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:32,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:32,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:32,180 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-08 17:20:32,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:32,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:20:32,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:32,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:20:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:20:32,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:20:32,181 INFO L87 Difference]: Start difference. First operand 2007 states and 5339 transitions. Second operand 7 states. [2018-12-08 17:20:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:32,410 INFO L93 Difference]: Finished difference Result 2413 states and 6166 transitions. [2018-12-08 17:20:32,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:20:32,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-12-08 17:20:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:32,412 INFO L225 Difference]: With dead ends: 2413 [2018-12-08 17:20:32,412 INFO L226 Difference]: Without dead ends: 2329 [2018-12-08 17:20:32,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:20:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-12-08 17:20:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2253. [2018-12-08 17:20:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2018-12-08 17:20:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5861 transitions. [2018-12-08 17:20:32,427 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5861 transitions. Word has length 90 [2018-12-08 17:20:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:32,427 INFO L480 AbstractCegarLoop]: Abstraction has 2253 states and 5861 transitions. [2018-12-08 17:20:32,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:20:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5861 transitions. [2018-12-08 17:20:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 17:20:32,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:32,429 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] [2018-12-08 17:20:32,429 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:32,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:32,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2095676199, now seen corresponding path program 1 times [2018-12-08 17:20:32,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:32,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:32,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:32,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-08 17:20:32,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:32,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:20:32,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:32,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:20:32,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:20:32,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:20:32,515 INFO L87 Difference]: Start difference. First operand 2253 states and 5861 transitions. Second operand 5 states. [2018-12-08 17:20:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:32,637 INFO L93 Difference]: Finished difference Result 2790 states and 7091 transitions. [2018-12-08 17:20:32,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:20:32,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-08 17:20:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:32,640 INFO L225 Difference]: With dead ends: 2790 [2018-12-08 17:20:32,640 INFO L226 Difference]: Without dead ends: 2751 [2018-12-08 17:20:32,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:20:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2018-12-08 17:20:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2379. [2018-12-08 17:20:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2018-12-08 17:20:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 6127 transitions. [2018-12-08 17:20:32,665 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 6127 transitions. Word has length 90 [2018-12-08 17:20:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:32,665 INFO L480 AbstractCegarLoop]: Abstraction has 2379 states and 6127 transitions. [2018-12-08 17:20:32,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:20:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 6127 transitions. [2018-12-08 17:20:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 17:20:32,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:32,667 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] [2018-12-08 17:20:32,668 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:32,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:32,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1989063700, now seen corresponding path program 1 times [2018-12-08 17:20:32,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:32,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-08 17:20:32,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:32,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:20:32,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:32,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:20:32,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:20:32,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:20:32,701 INFO L87 Difference]: Start difference. First operand 2379 states and 6127 transitions. Second operand 3 states. [2018-12-08 17:20:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:32,781 INFO L93 Difference]: Finished difference Result 2489 states and 6361 transitions. [2018-12-08 17:20:32,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:20:32,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-08 17:20:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:32,784 INFO L225 Difference]: With dead ends: 2489 [2018-12-08 17:20:32,784 INFO L226 Difference]: Without dead ends: 2489 [2018-12-08 17:20:32,784 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-08 17:20:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2018-12-08 17:20:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2417. [2018-12-08 17:20:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2417 states. [2018-12-08 17:20:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 6205 transitions. [2018-12-08 17:20:32,802 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 6205 transitions. Word has length 90 [2018-12-08 17:20:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:32,802 INFO L480 AbstractCegarLoop]: Abstraction has 2417 states and 6205 transitions. [2018-12-08 17:20:32,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:20:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 6205 transitions. [2018-12-08 17:20:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 17:20:32,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:32,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:32,805 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:32,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash 353378826, now seen corresponding path program 1 times [2018-12-08 17:20:32,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:32,836 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-08 17:20:32,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:32,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:20:32,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:32,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:20:32,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:20:32,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:20:32,836 INFO L87 Difference]: Start difference. First operand 2417 states and 6205 transitions. Second operand 4 states. [2018-12-08 17:20:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:32,924 INFO L93 Difference]: Finished difference Result 4371 states and 11304 transitions. [2018-12-08 17:20:32,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:20:32,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-08 17:20:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:32,927 INFO L225 Difference]: With dead ends: 4371 [2018-12-08 17:20:32,928 INFO L226 Difference]: Without dead ends: 4371 [2018-12-08 17:20:32,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-08 17:20:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2018-12-08 17:20:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 2349. [2018-12-08 17:20:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2018-12-08 17:20:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 5959 transitions. [2018-12-08 17:20:32,950 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 5959 transitions. Word has length 92 [2018-12-08 17:20:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:32,950 INFO L480 AbstractCegarLoop]: Abstraction has 2349 states and 5959 transitions. [2018-12-08 17:20:32,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:20:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 5959 transitions. [2018-12-08 17:20:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 17:20:32,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:32,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:32,952 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:32,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1349001223, now seen corresponding path program 1 times [2018-12-08 17:20:32,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:32,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:32,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:32,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:20:32,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:32,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:20:32,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:32,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:20:32,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:20:32,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:20:32,996 INFO L87 Difference]: Start difference. First operand 2349 states and 5959 transitions. Second operand 4 states. [2018-12-08 17:20:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:33,077 INFO L93 Difference]: Finished difference Result 2685 states and 6879 transitions. [2018-12-08 17:20:33,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:20:33,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-08 17:20:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:33,080 INFO L225 Difference]: With dead ends: 2685 [2018-12-08 17:20:33,080 INFO L226 Difference]: Without dead ends: 2685 [2018-12-08 17:20:33,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:20:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2018-12-08 17:20:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2653. [2018-12-08 17:20:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2018-12-08 17:20:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 6799 transitions. [2018-12-08 17:20:33,096 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 6799 transitions. Word has length 92 [2018-12-08 17:20:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:33,097 INFO L480 AbstractCegarLoop]: Abstraction has 2653 states and 6799 transitions. [2018-12-08 17:20:33,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:20:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 6799 transitions. [2018-12-08 17:20:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 17:20:33,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:33,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:33,099 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:33,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash 868756730, now seen corresponding path program 1 times [2018-12-08 17:20:33,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:33,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:33,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:33,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:33,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:33,163 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-08 17:20:33,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:33,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:20:33,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:33,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:20:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:20:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:20:33,164 INFO L87 Difference]: Start difference. First operand 2653 states and 6799 transitions. Second operand 6 states. [2018-12-08 17:20:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:33,335 INFO L93 Difference]: Finished difference Result 3995 states and 10189 transitions. [2018-12-08 17:20:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:20:33,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-08 17:20:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:33,339 INFO L225 Difference]: With dead ends: 3995 [2018-12-08 17:20:33,339 INFO L226 Difference]: Without dead ends: 3963 [2018-12-08 17:20:33,339 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-08 17:20:33,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2018-12-08 17:20:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3559. [2018-12-08 17:20:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2018-12-08 17:20:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 9122 transitions. [2018-12-08 17:20:33,371 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 9122 transitions. Word has length 92 [2018-12-08 17:20:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:33,372 INFO L480 AbstractCegarLoop]: Abstraction has 3559 states and 9122 transitions. [2018-12-08 17:20:33,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:20:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 9122 transitions. [2018-12-08 17:20:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 17:20:33,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:33,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:33,376 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:33,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:33,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1830370747, now seen corresponding path program 1 times [2018-12-08 17:20:33,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:33,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:33,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:33,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:33,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:33,443 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-08 17:20:33,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:33,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:20:33,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:33,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:20:33,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:20:33,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:20:33,444 INFO L87 Difference]: Start difference. First operand 3559 states and 9122 transitions. Second operand 7 states. [2018-12-08 17:20:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:33,730 INFO L93 Difference]: Finished difference Result 7660 states and 19944 transitions. [2018-12-08 17:20:33,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:20:33,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-08 17:20:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:33,737 INFO L225 Difference]: With dead ends: 7660 [2018-12-08 17:20:33,737 INFO L226 Difference]: Without dead ends: 7660 [2018-12-08 17:20:33,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:20:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2018-12-08 17:20:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 4179. [2018-12-08 17:20:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2018-12-08 17:20:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 10752 transitions. [2018-12-08 17:20:33,777 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 10752 transitions. Word has length 92 [2018-12-08 17:20:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:33,778 INFO L480 AbstractCegarLoop]: Abstraction has 4179 states and 10752 transitions. [2018-12-08 17:20:33,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:20:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 10752 transitions. [2018-12-08 17:20:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 17:20:33,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:33,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:20:33,781 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:33,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1219832068, now seen corresponding path program 1 times [2018-12-08 17:20:33,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:33,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:33,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:33,868 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-08 17:20:33,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:33,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:20:33,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:33,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:20:33,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:20:33,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:20:33,869 INFO L87 Difference]: Start difference. First operand 4179 states and 10752 transitions. Second operand 7 states. [2018-12-08 17:20:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:34,069 INFO L93 Difference]: Finished difference Result 3925 states and 10102 transitions. [2018-12-08 17:20:34,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:20:34,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-08 17:20:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:34,074 INFO L225 Difference]: With dead ends: 3925 [2018-12-08 17:20:34,074 INFO L226 Difference]: Without dead ends: 3925 [2018-12-08 17:20:34,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:20:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-12-08 17:20:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3771. [2018-12-08 17:20:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3771 states. [2018-12-08 17:20:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 9774 transitions. [2018-12-08 17:20:34,169 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 9774 transitions. Word has length 92 [2018-12-08 17:20:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:34,169 INFO L480 AbstractCegarLoop]: Abstraction has 3771 states and 9774 transitions. [2018-12-08 17:20:34,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:20:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 9774 transitions. [2018-12-08 17:20:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 17:20:34,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:34,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:20:34,174 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:34,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:34,175 INFO L82 PathProgramCache]: Analyzing trace with hash -124272980, now seen corresponding path program 1 times [2018-12-08 17:20:34,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:34,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:34,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:34,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:34,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:34,247 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-08 17:20:34,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:34,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:20:34,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:34,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:20:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:20:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:20:34,248 INFO L87 Difference]: Start difference. First operand 3771 states and 9774 transitions. Second operand 7 states. [2018-12-08 17:20:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:34,451 INFO L93 Difference]: Finished difference Result 4019 states and 10380 transitions. [2018-12-08 17:20:34,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:20:34,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-08 17:20:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:34,455 INFO L225 Difference]: With dead ends: 4019 [2018-12-08 17:20:34,455 INFO L226 Difference]: Without dead ends: 4019 [2018-12-08 17:20:34,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:20:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2018-12-08 17:20:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 3753. [2018-12-08 17:20:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2018-12-08 17:20:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 9738 transitions. [2018-12-08 17:20:34,480 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 9738 transitions. Word has length 92 [2018-12-08 17:20:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:34,480 INFO L480 AbstractCegarLoop]: Abstraction has 3753 states and 9738 transitions. [2018-12-08 17:20:34,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:20:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 9738 transitions. [2018-12-08 17:20:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 17:20:34,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:34,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:34,483 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:34,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1286606540, now seen corresponding path program 1 times [2018-12-08 17:20:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:34,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:34,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:20:34,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:34,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:20:34,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:34,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:20:34,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:20:34,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:20:34,559 INFO L87 Difference]: Start difference. First operand 3753 states and 9738 transitions. Second operand 5 states. [2018-12-08 17:20:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:34,619 INFO L93 Difference]: Finished difference Result 3485 states and 9046 transitions. [2018-12-08 17:20:34,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:20:34,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-08 17:20:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:34,621 INFO L225 Difference]: With dead ends: 3485 [2018-12-08 17:20:34,621 INFO L226 Difference]: Without dead ends: 3485 [2018-12-08 17:20:34,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:20:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-12-08 17:20:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3485. [2018-12-08 17:20:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3485 states. [2018-12-08 17:20:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 9046 transitions. [2018-12-08 17:20:34,644 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 9046 transitions. Word has length 92 [2018-12-08 17:20:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:34,644 INFO L480 AbstractCegarLoop]: Abstraction has 3485 states and 9046 transitions. [2018-12-08 17:20:34,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:20:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 9046 transitions. [2018-12-08 17:20:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 17:20:34,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:34,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:34,647 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:34,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash -649053747, now seen corresponding path program 1 times [2018-12-08 17:20:34,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:34,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:34,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:34,704 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-08 17:20:34,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:34,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:20:34,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:34,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:20:34,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:20:34,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:20:34,706 INFO L87 Difference]: Start difference. First operand 3485 states and 9046 transitions. Second operand 6 states. [2018-12-08 17:20:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:34,797 INFO L93 Difference]: Finished difference Result 2877 states and 7206 transitions. [2018-12-08 17:20:34,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:20:34,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-08 17:20:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:34,799 INFO L225 Difference]: With dead ends: 2877 [2018-12-08 17:20:34,799 INFO L226 Difference]: Without dead ends: 2877 [2018-12-08 17:20:34,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:20:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2018-12-08 17:20:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1898. [2018-12-08 17:20:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2018-12-08 17:20:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 4870 transitions. [2018-12-08 17:20:34,815 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 4870 transitions. Word has length 92 [2018-12-08 17:20:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:34,815 INFO L480 AbstractCegarLoop]: Abstraction has 1898 states and 4870 transitions. [2018-12-08 17:20:34,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:20:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 4870 transitions. [2018-12-08 17:20:34,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:20:34,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:34,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, 1, 1, 1] [2018-12-08 17:20:34,817 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:34,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:34,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1039708687, now seen corresponding path program 1 times [2018-12-08 17:20:34,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:34,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:34,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:34,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:34,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:34,856 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-08 17:20:34,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:34,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:20:34,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:34,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:20:34,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:20:34,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:20:34,857 INFO L87 Difference]: Start difference. First operand 1898 states and 4870 transitions. Second operand 7 states. [2018-12-08 17:20:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:35,129 INFO L93 Difference]: Finished difference Result 2829 states and 7095 transitions. [2018-12-08 17:20:35,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:20:35,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-08 17:20:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:35,131 INFO L225 Difference]: With dead ends: 2829 [2018-12-08 17:20:35,131 INFO L226 Difference]: Without dead ends: 2829 [2018-12-08 17:20:35,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:20:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2018-12-08 17:20:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2248. [2018-12-08 17:20:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-12-08 17:20:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5728 transitions. [2018-12-08 17:20:35,147 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5728 transitions. Word has length 94 [2018-12-08 17:20:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:35,147 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5728 transitions. [2018-12-08 17:20:35,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:20:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5728 transitions. [2018-12-08 17:20:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:20:35,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:35,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:35,149 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:35,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:35,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2010494128, now seen corresponding path program 1 times [2018-12-08 17:20:35,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:35,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:35,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:35,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:35,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:35,201 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-08 17:20:35,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:35,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:20:35,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:35,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:20:35,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:20:35,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:20:35,202 INFO L87 Difference]: Start difference. First operand 2248 states and 5728 transitions. Second operand 6 states. [2018-12-08 17:20:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:35,305 INFO L93 Difference]: Finished difference Result 2288 states and 5773 transitions. [2018-12-08 17:20:35,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:20:35,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-08 17:20:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:35,307 INFO L225 Difference]: With dead ends: 2288 [2018-12-08 17:20:35,307 INFO L226 Difference]: Without dead ends: 2288 [2018-12-08 17:20:35,307 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-08 17:20:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-12-08 17:20:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2233. [2018-12-08 17:20:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2018-12-08 17:20:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 5666 transitions. [2018-12-08 17:20:35,323 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 5666 transitions. Word has length 94 [2018-12-08 17:20:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:35,324 INFO L480 AbstractCegarLoop]: Abstraction has 2233 states and 5666 transitions. [2018-12-08 17:20:35,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:20:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 5666 transitions. [2018-12-08 17:20:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:20:35,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:35,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:35,326 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:35,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:35,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1369474448, now seen corresponding path program 1 times [2018-12-08 17:20:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:35,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:35,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:35,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:35,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:35,372 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-08 17:20:35,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:35,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:20:35,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:35,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:20:35,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:20:35,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:20:35,373 INFO L87 Difference]: Start difference. First operand 2233 states and 5666 transitions. Second operand 6 states. [2018-12-08 17:20:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:35,522 INFO L93 Difference]: Finished difference Result 2807 states and 6976 transitions. [2018-12-08 17:20:35,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:20:35,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-08 17:20:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:35,524 INFO L225 Difference]: With dead ends: 2807 [2018-12-08 17:20:35,524 INFO L226 Difference]: Without dead ends: 2807 [2018-12-08 17:20:35,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:20:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2018-12-08 17:20:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2281. [2018-12-08 17:20:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2018-12-08 17:20:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 5746 transitions. [2018-12-08 17:20:35,540 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 5746 transitions. Word has length 94 [2018-12-08 17:20:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:35,540 INFO L480 AbstractCegarLoop]: Abstraction has 2281 states and 5746 transitions. [2018-12-08 17:20:35,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:20:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 5746 transitions. [2018-12-08 17:20:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:20:35,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:35,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:35,542 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:35,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2138644463, now seen corresponding path program 1 times [2018-12-08 17:20:35,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:35,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:35,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:35,573 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-08 17:20:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:20:35,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:35,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:20:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:20:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:20:35,575 INFO L87 Difference]: Start difference. First operand 2281 states and 5746 transitions. Second operand 5 states. [2018-12-08 17:20:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:35,670 INFO L93 Difference]: Finished difference Result 2601 states and 6546 transitions. [2018-12-08 17:20:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:20:35,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-08 17:20:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:35,672 INFO L225 Difference]: With dead ends: 2601 [2018-12-08 17:20:35,672 INFO L226 Difference]: Without dead ends: 2601 [2018-12-08 17:20:35,672 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-08 17:20:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2018-12-08 17:20:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2009. [2018-12-08 17:20:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-12-08 17:20:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5085 transitions. [2018-12-08 17:20:35,688 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5085 transitions. Word has length 94 [2018-12-08 17:20:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:35,688 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5085 transitions. [2018-12-08 17:20:35,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:20:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5085 transitions. [2018-12-08 17:20:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:20:35,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:35,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:35,689 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:35,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash -911558352, now seen corresponding path program 1 times [2018-12-08 17:20:35,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:35,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:35,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:35,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:35,780 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-08 17:20:35,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:35,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:20:35,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:35,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:20:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:20:35,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:20:35,781 INFO L87 Difference]: Start difference. First operand 2009 states and 5085 transitions. Second operand 10 states. [2018-12-08 17:20:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:36,122 INFO L93 Difference]: Finished difference Result 3694 states and 9553 transitions. [2018-12-08 17:20:36,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:20:36,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2018-12-08 17:20:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:36,125 INFO L225 Difference]: With dead ends: 3694 [2018-12-08 17:20:36,125 INFO L226 Difference]: Without dead ends: 1719 [2018-12-08 17:20:36,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:20:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2018-12-08 17:20:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2018-12-08 17:20:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-12-08 17:20:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 4515 transitions. [2018-12-08 17:20:36,149 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 4515 transitions. Word has length 94 [2018-12-08 17:20:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:36,149 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 4515 transitions. [2018-12-08 17:20:36,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:20:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 4515 transitions. [2018-12-08 17:20:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:20:36,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:36,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:36,151 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:36,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash 220287440, now seen corresponding path program 1 times [2018-12-08 17:20:36,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:36,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:36,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:36,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:36,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:36,202 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-08 17:20:36,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:36,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:20:36,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:36,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:20:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:20:36,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:20:36,202 INFO L87 Difference]: Start difference. First operand 1719 states and 4515 transitions. Second operand 6 states. [2018-12-08 17:20:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:36,387 INFO L93 Difference]: Finished difference Result 1963 states and 5062 transitions. [2018-12-08 17:20:36,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:20:36,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-08 17:20:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:36,390 INFO L225 Difference]: With dead ends: 1963 [2018-12-08 17:20:36,390 INFO L226 Difference]: Without dead ends: 1963 [2018-12-08 17:20:36,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:20:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2018-12-08 17:20:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1746. [2018-12-08 17:20:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1746 states. [2018-12-08 17:20:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 4570 transitions. [2018-12-08 17:20:36,406 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 4570 transitions. Word has length 94 [2018-12-08 17:20:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:36,406 INFO L480 AbstractCegarLoop]: Abstraction has 1746 states and 4570 transitions. [2018-12-08 17:20:36,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:20:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 4570 transitions. [2018-12-08 17:20:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:20:36,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:36,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:36,408 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:36,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:36,409 INFO L82 PathProgramCache]: Analyzing trace with hash 550053201, now seen corresponding path program 1 times [2018-12-08 17:20:36,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:36,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:36,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:36,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:36,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:36,470 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-08 17:20:36,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:36,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:20:36,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:36,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:20:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:20:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:20:36,471 INFO L87 Difference]: Start difference. First operand 1746 states and 4570 transitions. Second operand 6 states. [2018-12-08 17:20:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:36,545 INFO L93 Difference]: Finished difference Result 1805 states and 4679 transitions. [2018-12-08 17:20:36,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:20:36,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-08 17:20:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:36,547 INFO L225 Difference]: With dead ends: 1805 [2018-12-08 17:20:36,548 INFO L226 Difference]: Without dead ends: 1789 [2018-12-08 17:20:36,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:20:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-12-08 17:20:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1719. [2018-12-08 17:20:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-12-08 17:20:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 4507 transitions. [2018-12-08 17:20:36,562 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 4507 transitions. Word has length 94 [2018-12-08 17:20:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:36,562 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 4507 transitions. [2018-12-08 17:20:36,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:20:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 4507 transitions. [2018-12-08 17:20:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:20:36,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:36,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:36,565 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:36,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1480453039, now seen corresponding path program 1 times [2018-12-08 17:20:36,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:36,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:36,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:20:36,618 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-08 17:20:36,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:20:36,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:20:36,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:20:36,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:20:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:20:36,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:20:36,619 INFO L87 Difference]: Start difference. First operand 1719 states and 4507 transitions. Second operand 6 states. [2018-12-08 17:20:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:20:36,733 INFO L93 Difference]: Finished difference Result 1761 states and 4583 transitions. [2018-12-08 17:20:36,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:20:36,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-08 17:20:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:20:36,735 INFO L225 Difference]: With dead ends: 1761 [2018-12-08 17:20:36,735 INFO L226 Difference]: Without dead ends: 1761 [2018-12-08 17:20:36,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:20:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2018-12-08 17:20:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1754. [2018-12-08 17:20:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-12-08 17:20:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4570 transitions. [2018-12-08 17:20:36,748 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4570 transitions. Word has length 94 [2018-12-08 17:20:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:20:36,748 INFO L480 AbstractCegarLoop]: Abstraction has 1754 states and 4570 transitions. [2018-12-08 17:20:36,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:20:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4570 transitions. [2018-12-08 17:20:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 17:20:36,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:20:36,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:20:36,750 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:20:36,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:20:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1150687278, now seen corresponding path program 2 times [2018-12-08 17:20:36,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:20:36,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:36,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:20:36,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:20:36,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:20:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:20:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:20:36,798 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:20:36,884 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 17:20:36,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:20:36 BasicIcfg [2018-12-08 17:20:36,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:20:36,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:20:36,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:20:36,886 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:20:36,886 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:20:27" (3/4) ... [2018-12-08 17:20:36,888 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 17:20:36,977 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7fd23a25-d7ba-4f3e-ac4e-f6837fd47deb/bin-2019/utaipan/witness.graphml [2018-12-08 17:20:36,977 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:20:36,978 INFO L168 Benchmark]: Toolchain (without parser) took 10519.73 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 951.3 MB in the beginning and 696.7 MB in the end (delta: 254.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-08 17:20:36,979 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:20:36,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-08 17:20:36,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.20 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-08 17:20:36,980 INFO L168 Benchmark]: Boogie Preprocessor took 20.64 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-08 17:20:36,980 INFO L168 Benchmark]: RCFGBuilder took 378.90 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:20:36,980 INFO L168 Benchmark]: TraceAbstraction took 9667.72 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 998.8 MB). Free memory was 1.1 GB in the beginning and 720.3 MB in the end (delta: 355.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-08 17:20:36,980 INFO L168 Benchmark]: Witness Printer took 91.54 ms. Allocated memory is still 2.2 GB. Free memory was 720.3 MB in the beginning and 696.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2018-12-08 17:20:36,982 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.20 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.64 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 378.90 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9667.72 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 998.8 MB). Free memory was 1.1 GB in the beginning and 720.3 MB in the end (delta: 355.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 91.54 ms. Allocated memory is still 2.2 GB. Free memory was 720.3 MB in the beginning and 696.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L679] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L680] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L681] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L682] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L683] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L684] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L685] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L686] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L687] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L688] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L689] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L690] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L691] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L693] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t1449; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] -1 pthread_t t1450; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] FCALL, FORK -1 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 x$w_buff1 = x$w_buff0 [L720] 0 x$w_buff0 = 2 [L721] 0 x$w_buff1_used = x$w_buff0_used [L722] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L725] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L726] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L727] 0 x$r_buff0_thd2 = (_Bool)1 [L730] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] 1 y = 1 [L702] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L706] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L767] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L768] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 x$flush_delayed = weak$$choice2 [L774] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L776] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L778] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L781] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x = x$flush_delayed ? x$mem_tmp : x [L784] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 9.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4907 SDtfs, 4375 SDslu, 10892 SDs, 0 SdLazy, 4434 SolverSat, 246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 60 SyntacticMatches, 17 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37141occurred in iteration=2, 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: 2.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 58643 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2089 NumberOfCodeBlocks, 2089 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1971 ConstructedInterpolants, 0 QuantifiedInterpolants, 415065 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...