./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/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 08bc1f8a13d0042f6e36f207172f32d81bf0e164 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-03 06:32:20,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:32:20,298 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:32:20,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:32:20,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:32:20,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:32:20,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:32:20,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:32:20,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:32:20,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:32:20,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:32:20,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:32:20,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:32:20,314 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:32:20,315 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:32:20,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:32:20,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:32:20,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:32:20,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:32:20,320 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:32:20,321 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:32:20,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:32:20,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:32:20,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:32:20,323 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:32:20,324 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:32:20,325 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:32:20,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:32:20,326 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:32:20,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:32:20,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:32:20,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:32:20,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:32:20,327 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:32:20,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:32:20,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:32:20,329 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 06:32:20,339 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:32:20,339 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:32:20,340 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:32:20,340 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:32:20,340 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:32:20,340 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:32:20,341 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:32:20,341 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 06:32:20,341 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:32:20,341 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:32:20,341 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 06:32:20,341 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 06:32:20,341 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:32:20,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:32:20,342 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:32:20,342 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:32:20,342 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:32:20,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:32:20,343 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 06:32:20,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:32:20,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 06:32:20,343 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:32:20,343 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 06:32:20,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 06:32:20,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:32:20,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:32:20,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:32:20,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:32:20,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:32:20,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:32:20,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:32:20,345 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 06:32:20,345 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 06:32:20,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:32:20,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 06:32:20,345 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 06:32:20,345 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_006b979c-4d2b-4969-a677-0f8b853805c0/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 -> 08bc1f8a13d0042f6e36f207172f32d81bf0e164 [2018-12-03 06:32:20,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:32:20,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:32:20,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:32:20,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:32:20,379 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:32:20,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc_false-unreach-call.i [2018-12-03 06:32:20,418 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/data/d660ecdbf/a001f73b6bc143dfacb9a142bcfa47d0/FLAG305f043ac [2018-12-03 06:32:20,898 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:32:20,898 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/sv-benchmarks/c/pthread-wmm/mix041_pso.oepc_false-unreach-call.i [2018-12-03 06:32:20,905 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/data/d660ecdbf/a001f73b6bc143dfacb9a142bcfa47d0/FLAG305f043ac [2018-12-03 06:32:21,400 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/data/d660ecdbf/a001f73b6bc143dfacb9a142bcfa47d0 [2018-12-03 06:32:21,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:32:21,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:32:21,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:32:21,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:32:21,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:32:21,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7014c445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21, skipping insertion in model container [2018-12-03 06:32:21,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:32:21,438 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:32:21,615 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:32:21,623 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:32:21,715 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:32:21,746 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:32:21,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21 WrapperNode [2018-12-03 06:32:21,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:32:21,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:32:21,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:32:21,747 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:32:21,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:32:21,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:32:21,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:32:21,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:32:21,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... [2018-12-03 06:32:21,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:32:21,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:32:21,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:32:21,800 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:32:21,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/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-03 06:32:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:32:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 06:32:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 06:32:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:32:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 06:32:21,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 06:32:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 06:32:21,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 06:32:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 06:32:21,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:32:21,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:32:21,835 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 06:32:22,135 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:32:22,135 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 06:32:22,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:32:22 BoogieIcfgContainer [2018-12-03 06:32:22,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:32:22,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:32:22,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:32:22,138 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:32:22,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:32:21" (1/3) ... [2018-12-03 06:32:22,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34db1b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:32:22, skipping insertion in model container [2018-12-03 06:32:22,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:32:21" (2/3) ... [2018-12-03 06:32:22,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34db1b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:32:22, skipping insertion in model container [2018-12-03 06:32:22,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:32:22" (3/3) ... [2018-12-03 06:32:22,140 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc_false-unreach-call.i [2018-12-03 06:32:22,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,162 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,162 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,163 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,163 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,163 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,164 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,165 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,166 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,174 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,175 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,176 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,177 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:32:22,181 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 06:32:22,181 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:32:22,186 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 06:32:22,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 06:32:22,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:32:22,210 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 06:32:22,210 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:32:22,210 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:32:22,210 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:32:22,210 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:32:22,210 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:32:22,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:32:22,217 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-03 06:32:23,927 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-03 06:32:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-03 06:32:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 06:32:23,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:23,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:23,936 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:23,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:23,940 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2018-12-03 06:32:23,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:23,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:23,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:24,077 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-03 06:32:24,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:24,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:32:24,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:24,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:32:24,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:32:24,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:32:24,092 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-03 06:32:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:24,560 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-03 06:32:24,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:32:24,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-03 06:32:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:24,714 INFO L225 Difference]: With dead ends: 60791 [2018-12-03 06:32:24,714 INFO L226 Difference]: Without dead ends: 44271 [2018-12-03 06:32:24,715 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-03 06:32:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-03 06:32:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-03 06:32:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-03 06:32:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-03 06:32:25,485 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-03 06:32:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:25,485 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-03 06:32:25,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:32:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-03 06:32:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 06:32:25,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:25,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:25,490 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:25,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2018-12-03 06:32:25,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:25,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:25,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:25,542 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-03 06:32:25,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:25,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:25,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:25,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:25,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:25,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:25,544 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-03 06:32:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:26,098 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-03 06:32:26,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:32:26,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-03 06:32:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:26,387 INFO L225 Difference]: With dead ends: 64005 [2018-12-03 06:32:26,387 INFO L226 Difference]: Without dead ends: 63453 [2018-12-03 06:32:26,388 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-03 06:32:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-03 06:32:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-03 06:32:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-03 06:32:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-03 06:32:27,162 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-03 06:32:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:27,163 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-03 06:32:27,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-03 06:32:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 06:32:27,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:27,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:27,167 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:27,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2018-12-03 06:32:27,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:27,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:27,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:27,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:27,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:27,232 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-03 06:32:27,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:27,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:27,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:27,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:27,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:27,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:27,233 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-03 06:32:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:27,784 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-03 06:32:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:32:27,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-03 06:32:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:27,929 INFO L225 Difference]: With dead ends: 81367 [2018-12-03 06:32:27,930 INFO L226 Difference]: Without dead ends: 80855 [2018-12-03 06:32:27,930 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-03 06:32:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-03 06:32:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-03 06:32:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-03 06:32:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-03 06:32:28,940 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-03 06:32:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:28,940 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-03 06:32:28,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-03 06:32:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 06:32:28,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:28,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:28,946 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:28,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2018-12-03 06:32:28,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:28,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:28,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:28,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:28,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:28,988 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-03 06:32:28,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:28,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:32:28,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:28,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:32:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:32:28,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:32:28,989 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-03 06:32:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:29,217 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-03 06:32:29,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:32:29,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-03 06:32:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:29,333 INFO L225 Difference]: With dead ends: 65251 [2018-12-03 06:32:29,334 INFO L226 Difference]: Without dead ends: 65251 [2018-12-03 06:32:29,334 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-03 06:32:29,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-03 06:32:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-03 06:32:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-03 06:32:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-03 06:32:30,453 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-03 06:32:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:30,454 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-03 06:32:30,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:32:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-03 06:32:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:32:30,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:30,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:30,463 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:30,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1592139769, now seen corresponding path program 1 times [2018-12-03 06:32:30,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:30,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:30,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:30,548 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-03 06:32:30,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:30,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:32:30,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:30,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:32:30,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:32:30,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:30,549 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-03 06:32:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:31,063 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-03 06:32:31,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:32:31,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-03 06:32:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:31,179 INFO L225 Difference]: With dead ends: 67511 [2018-12-03 06:32:31,179 INFO L226 Difference]: Without dead ends: 67511 [2018-12-03 06:32:31,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:32:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-03 06:32:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-03 06:32:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-03 06:32:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-03 06:32:32,359 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-03 06:32:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:32,359 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-03 06:32:32,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:32:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-03 06:32:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:32:32,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:32,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:32,369 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:32,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:32,369 INFO L82 PathProgramCache]: Analyzing trace with hash 905876168, now seen corresponding path program 1 times [2018-12-03 06:32:32,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:32,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:32,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:32,419 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-03 06:32:32,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:32,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:32:32,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:32,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:32:32,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:32:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:32:32,420 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-03 06:32:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:33,314 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-03 06:32:33,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:32:33,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-03 06:32:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:33,465 INFO L225 Difference]: With dead ends: 88528 [2018-12-03 06:32:33,465 INFO L226 Difference]: Without dead ends: 88528 [2018-12-03 06:32:33,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:32:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-03 06:32:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-03 06:32:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-03 06:32:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-03 06:32:34,664 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-03 06:32:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:34,664 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-03 06:32:34,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:32:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-03 06:32:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:32:34,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:34,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:34,674 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:34,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1793379849, now seen corresponding path program 1 times [2018-12-03 06:32:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:34,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:34,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:34,721 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-03 06:32:34,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:34,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:34,721 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:34,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:34,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:34,722 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 5 states. [2018-12-03 06:32:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:34,776 INFO L93 Difference]: Finished difference Result 15375 states and 48826 transitions. [2018-12-03 06:32:34,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:32:34,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-03 06:32:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:34,793 INFO L225 Difference]: With dead ends: 15375 [2018-12-03 06:32:34,793 INFO L226 Difference]: Without dead ends: 13789 [2018-12-03 06:32:34,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:32:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-03 06:32:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-03 06:32:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-03 06:32:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43352 transitions. [2018-12-03 06:32:35,042 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43352 transitions. Word has length 53 [2018-12-03 06:32:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:35,042 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43352 transitions. [2018-12-03 06:32:35,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43352 transitions. [2018-12-03 06:32:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:32:35,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:35,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:35,043 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:35,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2018-12-03 06:32:35,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:35,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:35,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:35,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:35,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:35,092 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-03 06:32:35,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:35,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:32:35,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:35,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:32:35,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:32:35,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:35,093 INFO L87 Difference]: Start difference. First operand 13740 states and 43352 transitions. Second operand 6 states. [2018-12-03 06:32:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:35,338 INFO L93 Difference]: Finished difference Result 19970 states and 62589 transitions. [2018-12-03 06:32:35,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 06:32:35,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-03 06:32:35,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:35,361 INFO L225 Difference]: With dead ends: 19970 [2018-12-03 06:32:35,361 INFO L226 Difference]: Without dead ends: 19898 [2018-12-03 06:32:35,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-03 06:32:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-03 06:32:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-03 06:32:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-03 06:32:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45049 transitions. [2018-12-03 06:32:35,538 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45049 transitions. Word has length 53 [2018-12-03 06:32:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:35,538 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45049 transitions. [2018-12-03 06:32:35,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:32:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45049 transitions. [2018-12-03 06:32:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 06:32:35,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:35,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:35,541 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:35,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2018-12-03 06:32:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:35,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:35,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:35,579 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-03 06:32:35,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:35,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:32:35,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:35,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:32:35,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:32:35,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:32:35,580 INFO L87 Difference]: Start difference. First operand 14314 states and 45049 transitions. Second operand 4 states. [2018-12-03 06:32:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:35,678 INFO L93 Difference]: Finished difference Result 16617 states and 52377 transitions. [2018-12-03 06:32:35,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:32:35,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-03 06:32:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:35,698 INFO L225 Difference]: With dead ends: 16617 [2018-12-03 06:32:35,699 INFO L226 Difference]: Without dead ends: 16617 [2018-12-03 06:32:35,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-03 06:32:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-03 06:32:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-03 06:32:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47639 transitions. [2018-12-03 06:32:35,872 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47639 transitions. Word has length 61 [2018-12-03 06:32:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:35,872 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47639 transitions. [2018-12-03 06:32:35,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:32:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47639 transitions. [2018-12-03 06:32:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 06:32:35,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:35,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:35,875 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:35,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2018-12-03 06:32:35,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:35,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:35,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:35,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:35,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:35,911 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-03 06:32:35,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:35,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:32:35,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:35,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:32:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:32:35,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:35,912 INFO L87 Difference]: Start difference. First operand 15134 states and 47639 transitions. Second operand 6 states. [2018-12-03 06:32:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:36,190 INFO L93 Difference]: Finished difference Result 28106 states and 88147 transitions. [2018-12-03 06:32:36,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 06:32:36,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-03 06:32:36,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:36,227 INFO L225 Difference]: With dead ends: 28106 [2018-12-03 06:32:36,227 INFO L226 Difference]: Without dead ends: 28035 [2018-12-03 06:32:36,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:32:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-03 06:32:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-03 06:32:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-03 06:32:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54313 transitions. [2018-12-03 06:32:36,464 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54313 transitions. Word has length 61 [2018-12-03 06:32:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:36,464 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54313 transitions. [2018-12-03 06:32:36,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:32:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54313 transitions. [2018-12-03 06:32:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 06:32:36,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:36,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:36,469 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:36,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:36,469 INFO L82 PathProgramCache]: Analyzing trace with hash 962407834, now seen corresponding path program 1 times [2018-12-03 06:32:36,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:36,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:36,496 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-03 06:32:36,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:36,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:32:36,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:36,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:32:36,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:32:36,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:32:36,497 INFO L87 Difference]: Start difference. First operand 17412 states and 54313 transitions. Second operand 3 states. [2018-12-03 06:32:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:36,627 INFO L93 Difference]: Finished difference Result 18092 states and 56145 transitions. [2018-12-03 06:32:36,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:32:36,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-03 06:32:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:36,647 INFO L225 Difference]: With dead ends: 18092 [2018-12-03 06:32:36,647 INFO L226 Difference]: Without dead ends: 18092 [2018-12-03 06:32:36,647 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-03 06:32:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-03 06:32:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-03 06:32:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-03 06:32:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55229 transitions. [2018-12-03 06:32:36,829 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55229 transitions. Word has length 65 [2018-12-03 06:32:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:36,829 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55229 transitions. [2018-12-03 06:32:36,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:32:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55229 transitions. [2018-12-03 06:32:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 06:32:36,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:36,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:36,834 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:36,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash -901897063, now seen corresponding path program 1 times [2018-12-03 06:32:36,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:36,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:36,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:36,876 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-03 06:32:36,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:36,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:32:36,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:36,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:32:36,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:32:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:32:36,877 INFO L87 Difference]: Start difference. First operand 17752 states and 55229 transitions. Second operand 4 states. [2018-12-03 06:32:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:37,042 INFO L93 Difference]: Finished difference Result 21696 states and 66718 transitions. [2018-12-03 06:32:37,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:32:37,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-03 06:32:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:37,065 INFO L225 Difference]: With dead ends: 21696 [2018-12-03 06:32:37,065 INFO L226 Difference]: Without dead ends: 21696 [2018-12-03 06:32:37,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:32:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-03 06:32:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-03 06:32:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-03 06:32:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60608 transitions. [2018-12-03 06:32:37,271 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60608 transitions. Word has length 65 [2018-12-03 06:32:37,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:37,271 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60608 transitions. [2018-12-03 06:32:37,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:32:37,271 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60608 transitions. [2018-12-03 06:32:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:32:37,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:37,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:37,278 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:37,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash -987757598, now seen corresponding path program 1 times [2018-12-03 06:32:37,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:37,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:37,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:37,343 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-03 06:32:37,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:37,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:32:37,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:37,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:32:37,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:32:37,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:37,344 INFO L87 Difference]: Start difference. First operand 19646 states and 60608 transitions. Second operand 6 states. [2018-12-03 06:32:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:37,975 INFO L93 Difference]: Finished difference Result 23814 states and 72326 transitions. [2018-12-03 06:32:37,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:32:37,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 06:32:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:37,999 INFO L225 Difference]: With dead ends: 23814 [2018-12-03 06:32:37,999 INFO L226 Difference]: Without dead ends: 23814 [2018-12-03 06:32:37,999 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-03 06:32:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-03 06:32:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-03 06:32:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-03 06:32:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68748 transitions. [2018-12-03 06:32:38,226 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68748 transitions. Word has length 67 [2018-12-03 06:32:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:38,226 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68748 transitions. [2018-12-03 06:32:38,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:32:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68748 transitions. [2018-12-03 06:32:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:32:38,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:38,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:38,234 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:38,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1230000355, now seen corresponding path program 1 times [2018-12-03 06:32:38,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:38,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:38,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:38,292 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-03 06:32:38,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:38,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:32:38,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:38,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:32:38,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:32:38,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:38,292 INFO L87 Difference]: Start difference. First operand 22474 states and 68748 transitions. Second operand 6 states. [2018-12-03 06:32:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:38,564 INFO L93 Difference]: Finished difference Result 25702 states and 76208 transitions. [2018-12-03 06:32:38,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:32:38,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 06:32:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:38,594 INFO L225 Difference]: With dead ends: 25702 [2018-12-03 06:32:38,594 INFO L226 Difference]: Without dead ends: 25702 [2018-12-03 06:32:38,594 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-03 06:32:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-03 06:32:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-03 06:32:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-03 06:32:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68854 transitions. [2018-12-03 06:32:38,841 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68854 transitions. Word has length 67 [2018-12-03 06:32:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:38,841 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68854 transitions. [2018-12-03 06:32:38,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:32:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68854 transitions. [2018-12-03 06:32:38,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:32:38,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:38,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:38,849 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:38,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:38,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1441351268, now seen corresponding path program 1 times [2018-12-03 06:32:38,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:38,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:38,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:38,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:38,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:38,890 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-03 06:32:38,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:38,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:38,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:38,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:38,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:38,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:38,891 INFO L87 Difference]: Start difference. First operand 22858 states and 68854 transitions. Second operand 5 states. [2018-12-03 06:32:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:39,121 INFO L93 Difference]: Finished difference Result 29793 states and 89419 transitions. [2018-12-03 06:32:39,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:32:39,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-03 06:32:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:39,157 INFO L225 Difference]: With dead ends: 29793 [2018-12-03 06:32:39,158 INFO L226 Difference]: Without dead ends: 29793 [2018-12-03 06:32:39,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:32:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-03 06:32:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-03 06:32:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-03 06:32:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80363 transitions. [2018-12-03 06:32:39,458 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80363 transitions. Word has length 67 [2018-12-03 06:32:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:39,458 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80363 transitions. [2018-12-03 06:32:39,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80363 transitions. [2018-12-03 06:32:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:32:39,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:39,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:39,467 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:39,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:39,468 INFO L82 PathProgramCache]: Analyzing trace with hash 930817091, now seen corresponding path program 1 times [2018-12-03 06:32:39,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:39,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:39,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:39,500 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-03 06:32:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:39,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:39,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:39,501 INFO L87 Difference]: Start difference. First operand 26814 states and 80363 transitions. Second operand 5 states. [2018-12-03 06:32:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:39,801 INFO L93 Difference]: Finished difference Result 36420 states and 108433 transitions. [2018-12-03 06:32:39,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:32:39,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-03 06:32:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:39,843 INFO L225 Difference]: With dead ends: 36420 [2018-12-03 06:32:39,843 INFO L226 Difference]: Without dead ends: 36420 [2018-12-03 06:32:39,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:32:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-03 06:32:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-03 06:32:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-03 06:32:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87839 transitions. [2018-12-03 06:32:40,207 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87839 transitions. Word has length 67 [2018-12-03 06:32:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:40,207 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87839 transitions. [2018-12-03 06:32:40,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87839 transitions. [2018-12-03 06:32:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:32:40,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:40,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:40,215 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:40,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:40,216 INFO L82 PathProgramCache]: Analyzing trace with hash -876637372, now seen corresponding path program 1 times [2018-12-03 06:32:40,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:40,245 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-03 06:32:40,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:40,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:40,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:40,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:40,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:40,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:40,246 INFO L87 Difference]: Start difference. First operand 29428 states and 87839 transitions. Second operand 5 states. [2018-12-03 06:32:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:40,278 INFO L93 Difference]: Finished difference Result 9076 states and 21915 transitions. [2018-12-03 06:32:40,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:32:40,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-03 06:32:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:40,283 INFO L225 Difference]: With dead ends: 9076 [2018-12-03 06:32:40,284 INFO L226 Difference]: Without dead ends: 7224 [2018-12-03 06:32:40,284 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-03 06:32:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2018-12-03 06:32:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 6121. [2018-12-03 06:32:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2018-12-03 06:32:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 14386 transitions. [2018-12-03 06:32:40,331 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 14386 transitions. Word has length 67 [2018-12-03 06:32:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:40,332 INFO L480 AbstractCegarLoop]: Abstraction has 6121 states and 14386 transitions. [2018-12-03 06:32:40,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 14386 transitions. [2018-12-03 06:32:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:32:40,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:40,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:40,336 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:40,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:40,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2018-12-03 06:32:40,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:40,350 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-03 06:32:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:40,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:32:40,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:40,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:32:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:32:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:32:40,351 INFO L87 Difference]: Start difference. First operand 6121 states and 14386 transitions. Second operand 3 states. [2018-12-03 06:32:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:40,376 INFO L93 Difference]: Finished difference Result 8340 states and 19493 transitions. [2018-12-03 06:32:40,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:32:40,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-03 06:32:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:40,381 INFO L225 Difference]: With dead ends: 8340 [2018-12-03 06:32:40,381 INFO L226 Difference]: Without dead ends: 8340 [2018-12-03 06:32:40,381 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-03 06:32:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2018-12-03 06:32:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 6060. [2018-12-03 06:32:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6060 states. [2018-12-03 06:32:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6060 states to 6060 states and 13926 transitions. [2018-12-03 06:32:40,429 INFO L78 Accepts]: Start accepts. Automaton has 6060 states and 13926 transitions. Word has length 67 [2018-12-03 06:32:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:40,430 INFO L480 AbstractCegarLoop]: Abstraction has 6060 states and 13926 transitions. [2018-12-03 06:32:40,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:32:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 6060 states and 13926 transitions. [2018-12-03 06:32:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 06:32:40,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:40,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:40,434 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:40,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2018-12-03 06:32:40,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:40,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:40,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:40,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-03 06:32:40,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:40,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:40,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:40,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:40,471 INFO L87 Difference]: Start difference. First operand 6060 states and 13926 transitions. Second operand 5 states. [2018-12-03 06:32:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:40,567 INFO L93 Difference]: Finished difference Result 7230 states and 16567 transitions. [2018-12-03 06:32:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:32:40,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-03 06:32:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:40,572 INFO L225 Difference]: With dead ends: 7230 [2018-12-03 06:32:40,572 INFO L226 Difference]: Without dead ends: 7230 [2018-12-03 06:32:40,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:32:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2018-12-03 06:32:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 6504. [2018-12-03 06:32:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2018-12-03 06:32:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 14930 transitions. [2018-12-03 06:32:40,619 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 14930 transitions. Word has length 73 [2018-12-03 06:32:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:40,619 INFO L480 AbstractCegarLoop]: Abstraction has 6504 states and 14930 transitions. [2018-12-03 06:32:40,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 14930 transitions. [2018-12-03 06:32:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 06:32:40,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:40,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:40,623 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:40,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2018-12-03 06:32:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:40,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:40,663 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-03 06:32:40,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:40,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:32:40,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:40,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:32:40,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:32:40,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:32:40,664 INFO L87 Difference]: Start difference. First operand 6504 states and 14930 transitions. Second operand 7 states. [2018-12-03 06:32:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:40,915 INFO L93 Difference]: Finished difference Result 7577 states and 17192 transitions. [2018-12-03 06:32:40,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 06:32:40,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-03 06:32:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:40,920 INFO L225 Difference]: With dead ends: 7577 [2018-12-03 06:32:40,920 INFO L226 Difference]: Without dead ends: 7458 [2018-12-03 06:32:40,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-03 06:32:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2018-12-03 06:32:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 6601. [2018-12-03 06:32:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6601 states. [2018-12-03 06:32:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 15023 transitions. [2018-12-03 06:32:40,987 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 15023 transitions. Word has length 73 [2018-12-03 06:32:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:40,987 INFO L480 AbstractCegarLoop]: Abstraction has 6601 states and 15023 transitions. [2018-12-03 06:32:40,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:32:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 15023 transitions. [2018-12-03 06:32:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 06:32:40,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:40,993 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-03 06:32:40,993 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:40,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:40,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1900952980, now seen corresponding path program 1 times [2018-12-03 06:32:40,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:40,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:32:41,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:41,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:32:41,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:41,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:32:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:32:41,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:32:41,028 INFO L87 Difference]: Start difference. First operand 6601 states and 15023 transitions. Second operand 4 states. [2018-12-03 06:32:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:41,201 INFO L93 Difference]: Finished difference Result 10288 states and 23294 transitions. [2018-12-03 06:32:41,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:32:41,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-03 06:32:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:41,209 INFO L225 Difference]: With dead ends: 10288 [2018-12-03 06:32:41,209 INFO L226 Difference]: Without dead ends: 10288 [2018-12-03 06:32:41,210 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-03 06:32:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10288 states. [2018-12-03 06:32:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10288 to 7721. [2018-12-03 06:32:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7721 states. [2018-12-03 06:32:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7721 states to 7721 states and 17357 transitions. [2018-12-03 06:32:41,293 INFO L78 Accepts]: Start accepts. Automaton has 7721 states and 17357 transitions. Word has length 92 [2018-12-03 06:32:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:41,294 INFO L480 AbstractCegarLoop]: Abstraction has 7721 states and 17357 transitions. [2018-12-03 06:32:41,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:32:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7721 states and 17357 transitions. [2018-12-03 06:32:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 06:32:41,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:41,300 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-03 06:32:41,300 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:41,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:41,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1397912027, now seen corresponding path program 1 times [2018-12-03 06:32:41,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:41,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:41,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:41,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:41,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:41,349 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-03 06:32:41,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:41,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:32:41,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:41,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:32:41,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:32:41,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:32:41,350 INFO L87 Difference]: Start difference. First operand 7721 states and 17357 transitions. Second operand 4 states. [2018-12-03 06:32:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:41,417 INFO L93 Difference]: Finished difference Result 8286 states and 18650 transitions. [2018-12-03 06:32:41,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:32:41,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-03 06:32:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:41,423 INFO L225 Difference]: With dead ends: 8286 [2018-12-03 06:32:41,423 INFO L226 Difference]: Without dead ends: 8286 [2018-12-03 06:32:41,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states. [2018-12-03 06:32:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 7627. [2018-12-03 06:32:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7627 states. [2018-12-03 06:32:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7627 states to 7627 states and 17252 transitions. [2018-12-03 06:32:41,480 INFO L78 Accepts]: Start accepts. Automaton has 7627 states and 17252 transitions. Word has length 92 [2018-12-03 06:32:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:41,480 INFO L480 AbstractCegarLoop]: Abstraction has 7627 states and 17252 transitions. [2018-12-03 06:32:41,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:32:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 7627 states and 17252 transitions. [2018-12-03 06:32:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:41,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:41,487 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-03 06:32:41,488 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:41,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:41,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1344279218, now seen corresponding path program 1 times [2018-12-03 06:32:41,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:41,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:41,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:41,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:41,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:41,540 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-03 06:32:41,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:41,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:41,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:41,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:41,541 INFO L87 Difference]: Start difference. First operand 7627 states and 17252 transitions. Second operand 5 states. [2018-12-03 06:32:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:41,710 INFO L93 Difference]: Finished difference Result 7193 states and 16104 transitions. [2018-12-03 06:32:41,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:32:41,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 06:32:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:41,716 INFO L225 Difference]: With dead ends: 7193 [2018-12-03 06:32:41,716 INFO L226 Difference]: Without dead ends: 7193 [2018-12-03 06:32:41,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7193 states. [2018-12-03 06:32:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7193 to 6761. [2018-12-03 06:32:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6761 states. [2018-12-03 06:32:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 15167 transitions. [2018-12-03 06:32:41,765 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 15167 transitions. Word has length 94 [2018-12-03 06:32:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:41,765 INFO L480 AbstractCegarLoop]: Abstraction has 6761 states and 15167 transitions. [2018-12-03 06:32:41,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 15167 transitions. [2018-12-03 06:32:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:41,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:41,772 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-03 06:32:41,772 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:41,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:41,772 INFO L82 PathProgramCache]: Analyzing trace with hash 895526994, now seen corresponding path program 1 times [2018-12-03 06:32:41,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:41,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:41,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:41,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:41,849 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-03 06:32:41,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:41,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 06:32:41,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:41,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 06:32:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 06:32:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:32:41,850 INFO L87 Difference]: Start difference. First operand 6761 states and 15167 transitions. Second operand 9 states. [2018-12-03 06:32:44,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:44,804 INFO L93 Difference]: Finished difference Result 18736 states and 41902 transitions. [2018-12-03 06:32:44,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 06:32:44,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-03 06:32:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:44,827 INFO L225 Difference]: With dead ends: 18736 [2018-12-03 06:32:44,827 INFO L226 Difference]: Without dead ends: 18617 [2018-12-03 06:32:44,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 06:32:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18617 states. [2018-12-03 06:32:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18617 to 10167. [2018-12-03 06:32:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10167 states. [2018-12-03 06:32:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10167 states to 10167 states and 23043 transitions. [2018-12-03 06:32:44,948 INFO L78 Accepts]: Start accepts. Automaton has 10167 states and 23043 transitions. Word has length 94 [2018-12-03 06:32:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:44,948 INFO L480 AbstractCegarLoop]: Abstraction has 10167 states and 23043 transitions. [2018-12-03 06:32:44,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 06:32:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 10167 states and 23043 transitions. [2018-12-03 06:32:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:44,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:44,956 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-03 06:32:44,956 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:44,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:44,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2140291475, now seen corresponding path program 1 times [2018-12-03 06:32:44,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:44,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:44,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:44,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:44,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:45,028 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-03 06:32:45,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:45,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:32:45,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:45,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:32:45,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:32:45,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:45,029 INFO L87 Difference]: Start difference. First operand 10167 states and 23043 transitions. Second operand 6 states. [2018-12-03 06:32:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:45,142 INFO L93 Difference]: Finished difference Result 10856 states and 24055 transitions. [2018-12-03 06:32:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:32:45,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 06:32:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:45,149 INFO L225 Difference]: With dead ends: 10856 [2018-12-03 06:32:45,149 INFO L226 Difference]: Without dead ends: 10816 [2018-12-03 06:32:45,149 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-03 06:32:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2018-12-03 06:32:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 9286. [2018-12-03 06:32:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2018-12-03 06:32:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 20765 transitions. [2018-12-03 06:32:45,223 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 20765 transitions. Word has length 94 [2018-12-03 06:32:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:45,223 INFO L480 AbstractCegarLoop]: Abstraction has 9286 states and 20765 transitions. [2018-12-03 06:32:45,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:32:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 20765 transitions. [2018-12-03 06:32:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:45,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:45,230 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-03 06:32:45,230 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:45,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash 616138610, now seen corresponding path program 1 times [2018-12-03 06:32:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:45,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:45,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:45,274 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-03 06:32:45,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:45,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:45,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:45,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:45,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:45,275 INFO L87 Difference]: Start difference. First operand 9286 states and 20765 transitions. Second operand 5 states. [2018-12-03 06:32:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:45,462 INFO L93 Difference]: Finished difference Result 11493 states and 25484 transitions. [2018-12-03 06:32:45,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:32:45,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 06:32:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:45,471 INFO L225 Difference]: With dead ends: 11493 [2018-12-03 06:32:45,471 INFO L226 Difference]: Without dead ends: 11313 [2018-12-03 06:32:45,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11313 states. [2018-12-03 06:32:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11313 to 10119. [2018-12-03 06:32:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10119 states. [2018-12-03 06:32:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10119 states to 10119 states and 22559 transitions. [2018-12-03 06:32:45,559 INFO L78 Accepts]: Start accepts. Automaton has 10119 states and 22559 transitions. Word has length 94 [2018-12-03 06:32:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:45,559 INFO L480 AbstractCegarLoop]: Abstraction has 10119 states and 22559 transitions. [2018-12-03 06:32:45,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 10119 states and 22559 transitions. [2018-12-03 06:32:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:45,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:45,566 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-03 06:32:45,566 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:45,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1679289107, now seen corresponding path program 1 times [2018-12-03 06:32:45,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:45,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:45,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:45,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:45,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:45,621 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-03 06:32:45,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:45,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:45,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:45,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:45,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:45,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:45,622 INFO L87 Difference]: Start difference. First operand 10119 states and 22559 transitions. Second operand 5 states. [2018-12-03 06:32:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:45,780 INFO L93 Difference]: Finished difference Result 12637 states and 27963 transitions. [2018-12-03 06:32:45,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:32:45,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 06:32:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:45,788 INFO L225 Difference]: With dead ends: 12637 [2018-12-03 06:32:45,788 INFO L226 Difference]: Without dead ends: 12504 [2018-12-03 06:32:45,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:32:45,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12504 states. [2018-12-03 06:32:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12504 to 10284. [2018-12-03 06:32:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10284 states. [2018-12-03 06:32:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10284 states to 10284 states and 22897 transitions. [2018-12-03 06:32:45,876 INFO L78 Accepts]: Start accepts. Automaton has 10284 states and 22897 transitions. Word has length 94 [2018-12-03 06:32:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:45,876 INFO L480 AbstractCegarLoop]: Abstraction has 10284 states and 22897 transitions. [2018-12-03 06:32:45,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10284 states and 22897 transitions. [2018-12-03 06:32:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:45,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:45,884 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-03 06:32:45,884 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:45,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:45,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1380573825, now seen corresponding path program 1 times [2018-12-03 06:32:45,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:45,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:45,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:45,945 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-03 06:32:45,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:45,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:32:45,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:45,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:32:45,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:32:45,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:32:45,946 INFO L87 Difference]: Start difference. First operand 10284 states and 22897 transitions. Second operand 5 states. [2018-12-03 06:32:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:46,030 INFO L93 Difference]: Finished difference Result 8323 states and 18531 transitions. [2018-12-03 06:32:46,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:32:46,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 06:32:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:46,036 INFO L225 Difference]: With dead ends: 8323 [2018-12-03 06:32:46,036 INFO L226 Difference]: Without dead ends: 8323 [2018-12-03 06:32:46,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:32:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8323 states. [2018-12-03 06:32:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8323 to 6728. [2018-12-03 06:32:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6728 states. [2018-12-03 06:32:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6728 states to 6728 states and 15087 transitions. [2018-12-03 06:32:46,095 INFO L78 Accepts]: Start accepts. Automaton has 6728 states and 15087 transitions. Word has length 94 [2018-12-03 06:32:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:46,095 INFO L480 AbstractCegarLoop]: Abstraction has 6728 states and 15087 transitions. [2018-12-03 06:32:46,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:32:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 6728 states and 15087 transitions. [2018-12-03 06:32:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:46,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:46,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, 1, 1] [2018-12-03 06:32:46,100 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:46,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:46,100 INFO L82 PathProgramCache]: Analyzing trace with hash 344907072, now seen corresponding path program 2 times [2018-12-03 06:32:46,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:46,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:46,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:46,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:46,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:46,197 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-03 06:32:46,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:46,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:32:46,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:46,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:32:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:32:46,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:32:46,197 INFO L87 Difference]: Start difference. First operand 6728 states and 15087 transitions. Second operand 7 states. [2018-12-03 06:32:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:46,515 INFO L93 Difference]: Finished difference Result 8442 states and 18687 transitions. [2018-12-03 06:32:46,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 06:32:46,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-03 06:32:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:46,523 INFO L225 Difference]: With dead ends: 8442 [2018-12-03 06:32:46,524 INFO L226 Difference]: Without dead ends: 8442 [2018-12-03 06:32:46,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:32:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8442 states. [2018-12-03 06:32:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8442 to 6841. [2018-12-03 06:32:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-03 06:32:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15326 transitions. [2018-12-03 06:32:46,584 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15326 transitions. Word has length 94 [2018-12-03 06:32:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:46,585 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15326 transitions. [2018-12-03 06:32:46,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:32:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15326 transitions. [2018-12-03 06:32:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:46,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:46,589 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-03 06:32:46,590 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:46,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1408057569, now seen corresponding path program 2 times [2018-12-03 06:32:46,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:46,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:32:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:46,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:46,656 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-03 06:32:46,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:46,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:32:46,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:46,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:32:46,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:32:46,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:32:46,657 INFO L87 Difference]: Start difference. First operand 6841 states and 15326 transitions. Second operand 7 states. [2018-12-03 06:32:46,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:46,865 INFO L93 Difference]: Finished difference Result 9658 states and 21670 transitions. [2018-12-03 06:32:46,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 06:32:46,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-03 06:32:46,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:46,871 INFO L225 Difference]: With dead ends: 9658 [2018-12-03 06:32:46,871 INFO L226 Difference]: Without dead ends: 9626 [2018-12-03 06:32:46,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:32:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2018-12-03 06:32:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 8903. [2018-12-03 06:32:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8903 states. [2018-12-03 06:32:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8903 states to 8903 states and 19928 transitions. [2018-12-03 06:32:46,938 INFO L78 Accepts]: Start accepts. Automaton has 8903 states and 19928 transitions. Word has length 94 [2018-12-03 06:32:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:46,939 INFO L480 AbstractCegarLoop]: Abstraction has 8903 states and 19928 transitions. [2018-12-03 06:32:46,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:32:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 8903 states and 19928 transitions. [2018-12-03 06:32:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:46,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:46,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:46,945 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:46,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash -388893790, now seen corresponding path program 1 times [2018-12-03 06:32:46,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:46,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:32:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:46,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:47,009 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-03 06:32:47,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:47,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:32:47,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:47,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:32:47,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:32:47,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:32:47,010 INFO L87 Difference]: Start difference. First operand 8903 states and 19928 transitions. Second operand 8 states. [2018-12-03 06:32:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:47,277 INFO L93 Difference]: Finished difference Result 14507 states and 33306 transitions. [2018-12-03 06:32:47,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 06:32:47,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-03 06:32:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:47,286 INFO L225 Difference]: With dead ends: 14507 [2018-12-03 06:32:47,286 INFO L226 Difference]: Without dead ends: 14507 [2018-12-03 06:32:47,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-03 06:32:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14507 states. [2018-12-03 06:32:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14507 to 9598. [2018-12-03 06:32:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9598 states. [2018-12-03 06:32:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 21764 transitions. [2018-12-03 06:32:47,378 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 21764 transitions. Word has length 94 [2018-12-03 06:32:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:47,378 INFO L480 AbstractCegarLoop]: Abstraction has 9598 states and 21764 transitions. [2018-12-03 06:32:47,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:32:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 21764 transitions. [2018-12-03 06:32:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:47,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:47,385 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-03 06:32:47,385 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:47,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:47,386 INFO L82 PathProgramCache]: Analyzing trace with hash 498609891, now seen corresponding path program 1 times [2018-12-03 06:32:47,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:47,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:47,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:47,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:47,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:47,452 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-03 06:32:47,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:47,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:32:47,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:47,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:32:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:32:47,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:47,453 INFO L87 Difference]: Start difference. First operand 9598 states and 21764 transitions. Second operand 6 states. [2018-12-03 06:32:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:47,495 INFO L93 Difference]: Finished difference Result 11871 states and 27171 transitions. [2018-12-03 06:32:47,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:32:47,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 06:32:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:47,502 INFO L225 Difference]: With dead ends: 11871 [2018-12-03 06:32:47,502 INFO L226 Difference]: Without dead ends: 11871 [2018-12-03 06:32:47,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2018-12-03 06:32:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 9768. [2018-12-03 06:32:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9768 states. [2018-12-03 06:32:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9768 states to 9768 states and 22014 transitions. [2018-12-03 06:32:47,587 INFO L78 Accepts]: Start accepts. Automaton has 9768 states and 22014 transitions. Word has length 94 [2018-12-03 06:32:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:47,587 INFO L480 AbstractCegarLoop]: Abstraction has 9768 states and 22014 transitions. [2018-12-03 06:32:47,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:32:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9768 states and 22014 transitions. [2018-12-03 06:32:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:47,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:47,594 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-03 06:32:47,595 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:47,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1430880478, now seen corresponding path program 1 times [2018-12-03 06:32:47,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:47,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:47,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:47,660 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-03 06:32:47,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:47,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:32:47,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:47,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:32:47,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:32:47,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:32:47,661 INFO L87 Difference]: Start difference. First operand 9768 states and 22014 transitions. Second operand 7 states. [2018-12-03 06:32:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:47,845 INFO L93 Difference]: Finished difference Result 10980 states and 24596 transitions. [2018-12-03 06:32:47,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 06:32:47,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-03 06:32:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:47,852 INFO L225 Difference]: With dead ends: 10980 [2018-12-03 06:32:47,853 INFO L226 Difference]: Without dead ends: 10980 [2018-12-03 06:32:47,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:32:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10980 states. [2018-12-03 06:32:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10980 to 9399. [2018-12-03 06:32:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9399 states. [2018-12-03 06:32:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9399 states to 9399 states and 21229 transitions. [2018-12-03 06:32:47,924 INFO L78 Accepts]: Start accepts. Automaton has 9399 states and 21229 transitions. Word has length 94 [2018-12-03 06:32:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:47,924 INFO L480 AbstractCegarLoop]: Abstraction has 9399 states and 21229 transitions. [2018-12-03 06:32:47,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:32:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 9399 states and 21229 transitions. [2018-12-03 06:32:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:47,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:47,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:47,931 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:47,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:47,931 INFO L82 PathProgramCache]: Analyzing trace with hash -510116673, now seen corresponding path program 1 times [2018-12-03 06:32:47,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:47,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:47,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:47,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:47,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:48,005 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-03 06:32:48,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:48,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 06:32:48,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:48,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 06:32:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 06:32:48,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:32:48,006 INFO L87 Difference]: Start difference. First operand 9399 states and 21229 transitions. Second operand 9 states. [2018-12-03 06:32:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:48,319 INFO L93 Difference]: Finished difference Result 11857 states and 26870 transitions. [2018-12-03 06:32:48,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 06:32:48,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-03 06:32:48,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:48,327 INFO L225 Difference]: With dead ends: 11857 [2018-12-03 06:32:48,327 INFO L226 Difference]: Without dead ends: 11825 [2018-12-03 06:32:48,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-03 06:32:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2018-12-03 06:32:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11825 to 9115. [2018-12-03 06:32:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2018-12-03 06:32:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 20545 transitions. [2018-12-03 06:32:48,404 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 20545 transitions. Word has length 94 [2018-12-03 06:32:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:48,404 INFO L480 AbstractCegarLoop]: Abstraction has 9115 states and 20545 transitions. [2018-12-03 06:32:48,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 06:32:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 20545 transitions. [2018-12-03 06:32:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:48,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:48,411 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-03 06:32:48,411 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:48,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:48,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1419564351, now seen corresponding path program 1 times [2018-12-03 06:32:48,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:48,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:48,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:48,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:48,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:48,512 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-03 06:32:48,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:48,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:32:48,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:48,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:32:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:32:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:32:48,513 INFO L87 Difference]: Start difference. First operand 9115 states and 20545 transitions. Second operand 7 states. [2018-12-03 06:32:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:48,611 INFO L93 Difference]: Finished difference Result 12593 states and 28746 transitions. [2018-12-03 06:32:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:32:48,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-03 06:32:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:48,619 INFO L225 Difference]: With dead ends: 12593 [2018-12-03 06:32:48,619 INFO L226 Difference]: Without dead ends: 12593 [2018-12-03 06:32:48,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:32:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12593 states. [2018-12-03 06:32:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12593 to 8941. [2018-12-03 06:32:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8941 states. [2018-12-03 06:32:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8941 states to 8941 states and 20007 transitions. [2018-12-03 06:32:48,701 INFO L78 Accepts]: Start accepts. Automaton has 8941 states and 20007 transitions. Word has length 94 [2018-12-03 06:32:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:48,701 INFO L480 AbstractCegarLoop]: Abstraction has 8941 states and 20007 transitions. [2018-12-03 06:32:48,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:32:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8941 states and 20007 transitions. [2018-12-03 06:32:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:32:48,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:48,708 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-03 06:32:48,708 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:48,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1143427393, now seen corresponding path program 1 times [2018-12-03 06:32:48,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:48,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:48,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:48,758 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-03 06:32:48,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:48,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:32:48,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:48,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:32:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:32:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:48,759 INFO L87 Difference]: Start difference. First operand 8941 states and 20007 transitions. Second operand 6 states. [2018-12-03 06:32:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:48,842 INFO L93 Difference]: Finished difference Result 8669 states and 19055 transitions. [2018-12-03 06:32:48,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:32:48,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 06:32:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:48,848 INFO L225 Difference]: With dead ends: 8669 [2018-12-03 06:32:48,848 INFO L226 Difference]: Without dead ends: 8669 [2018-12-03 06:32:48,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:32:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8669 states. [2018-12-03 06:32:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8669 to 5531. [2018-12-03 06:32:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5531 states. [2018-12-03 06:32:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 12086 transitions. [2018-12-03 06:32:48,897 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 12086 transitions. Word has length 94 [2018-12-03 06:32:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:48,897 INFO L480 AbstractCegarLoop]: Abstraction has 5531 states and 12086 transitions. [2018-12-03 06:32:48,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:32:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 12086 transitions. [2018-12-03 06:32:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:32:48,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:48,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:48,901 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:48,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:48,901 INFO L82 PathProgramCache]: Analyzing trace with hash -811380418, now seen corresponding path program 1 times [2018-12-03 06:32:48,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:48,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:48,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:48,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:48,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:32:48,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:48,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:32:48,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:48,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:32:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:32:48,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:32:48,981 INFO L87 Difference]: Start difference. First operand 5531 states and 12086 transitions. Second operand 8 states. [2018-12-03 06:32:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:49,153 INFO L93 Difference]: Finished difference Result 6611 states and 14366 transitions. [2018-12-03 06:32:49,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 06:32:49,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-03 06:32:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:49,157 INFO L225 Difference]: With dead ends: 6611 [2018-12-03 06:32:49,157 INFO L226 Difference]: Without dead ends: 6611 [2018-12-03 06:32:49,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-03 06:32:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6611 states. [2018-12-03 06:32:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6611 to 6521. [2018-12-03 06:32:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6521 states. [2018-12-03 06:32:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6521 states to 6521 states and 14180 transitions. [2018-12-03 06:32:49,204 INFO L78 Accepts]: Start accepts. Automaton has 6521 states and 14180 transitions. Word has length 96 [2018-12-03 06:32:49,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:49,205 INFO L480 AbstractCegarLoop]: Abstraction has 6521 states and 14180 transitions. [2018-12-03 06:32:49,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:32:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 6521 states and 14180 transitions. [2018-12-03 06:32:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:32:49,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:49,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:49,209 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:49,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash 76123263, now seen corresponding path program 1 times [2018-12-03 06:32:49,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:49,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:49,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:49,310 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-03 06:32:49,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:49,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 06:32:49,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:49,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 06:32:49,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 06:32:49,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:32:49,311 INFO L87 Difference]: Start difference. First operand 6521 states and 14180 transitions. Second operand 11 states. [2018-12-03 06:32:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:50,134 INFO L93 Difference]: Finished difference Result 12225 states and 26787 transitions. [2018-12-03 06:32:50,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 06:32:50,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-03 06:32:50,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:50,141 INFO L225 Difference]: With dead ends: 12225 [2018-12-03 06:32:50,141 INFO L226 Difference]: Without dead ends: 7823 [2018-12-03 06:32:50,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-03 06:32:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2018-12-03 06:32:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 5902. [2018-12-03 06:32:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5902 states. [2018-12-03 06:32:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 12818 transitions. [2018-12-03 06:32:50,185 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 12818 transitions. Word has length 96 [2018-12-03 06:32:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:50,185 INFO L480 AbstractCegarLoop]: Abstraction has 5902 states and 12818 transitions. [2018-12-03 06:32:50,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 06:32:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 12818 transitions. [2018-12-03 06:32:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:32:50,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:50,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:50,189 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:50,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1028496919, now seen corresponding path program 1 times [2018-12-03 06:32:50,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:50,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:50,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:32:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:32:50,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:32:50,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:32:50,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:32:50,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:32:50,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:32:50,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:32:50,235 INFO L87 Difference]: Start difference. First operand 5902 states and 12818 transitions. Second operand 6 states. [2018-12-03 06:32:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:32:50,412 INFO L93 Difference]: Finished difference Result 6737 states and 14653 transitions. [2018-12-03 06:32:50,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:32:50,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 06:32:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:32:50,416 INFO L225 Difference]: With dead ends: 6737 [2018-12-03 06:32:50,416 INFO L226 Difference]: Without dead ends: 6737 [2018-12-03 06:32:50,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:32:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6737 states. [2018-12-03 06:32:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6737 to 6085. [2018-12-03 06:32:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6085 states. [2018-12-03 06:32:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 13215 transitions. [2018-12-03 06:32:50,459 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 13215 transitions. Word has length 96 [2018-12-03 06:32:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:32:50,459 INFO L480 AbstractCegarLoop]: Abstraction has 6085 states and 13215 transitions. [2018-12-03 06:32:50,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:32:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 13215 transitions. [2018-12-03 06:32:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:32:50,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:32:50,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:32:50,463 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:32:50,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:32:50,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1130643175, now seen corresponding path program 2 times [2018-12-03 06:32:50,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:32:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:50,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:32:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:32:50,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:32:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:32:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:32:50,514 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 06:32:50,591 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 06:32:50,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:32:50 BasicIcfg [2018-12-03 06:32:50,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:32:50,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:32:50,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:32:50,592 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:32:50,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:32:22" (3/4) ... [2018-12-03 06:32:50,594 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 06:32:50,668 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_006b979c-4d2b-4969-a677-0f8b853805c0/bin-2019/utaipan/witness.graphml [2018-12-03 06:32:50,668 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:32:50,669 INFO L168 Benchmark]: Toolchain (without parser) took 29266.00 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 956.0 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-03 06:32:50,670 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:32:50,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -140.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-03 06:32:50,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.77 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-03 06:32:50,670 INFO L168 Benchmark]: Boogie Preprocessor took 20.39 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-03 06:32:50,670 INFO L168 Benchmark]: RCFGBuilder took 336.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2018-12-03 06:32:50,671 INFO L168 Benchmark]: TraceAbstraction took 28455.48 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-03 06:32:50,671 INFO L168 Benchmark]: Witness Printer took 75.81 ms. Allocated memory is still 4.5 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. [2018-12-03 06:32:50,672 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -140.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.77 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.39 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 336.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28455.48 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 75.81 ms. Allocated memory is still 4.5 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L684] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L685] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L686] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L687] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L688] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L689] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L690] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L691] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L692] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L693] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L694] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L695] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L696] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L697] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] -1 pthread_t t1095; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] FCALL, FORK -1 pthread_create(&t1095, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t1096; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t1096, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 28.3s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10677 SDtfs, 13530 SDslu, 25790 SDs, 0 SdLazy, 11419 SolverSat, 790 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 434 GetRequests, 103 SyntacticMatches, 38 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 187449 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3072 NumberOfCodeBlocks, 3072 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2937 ConstructedInterpolants, 0 QuantifiedInterpolants, 688880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...