./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/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 5107685577f81a5867811396b2c0a05eb5630c95 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:07:52,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:07:52,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:07:52,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:07:52,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:07:52,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:07:52,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:07:52,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:07:52,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:07:52,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:07:52,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:07:52,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:07:52,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:07:52,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:07:52,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:07:52,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:07:52,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:07:52,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:07:52,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:07:52,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:07:52,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:07:52,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:07:52,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:07:52,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:07:52,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:07:52,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:07:52,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:07:52,597 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:07:52,597 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:07:52,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:07:52,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:07:52,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:07:52,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:07:52,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:07:52,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:07:52,600 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:07:52,600 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 04:07:52,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:07:52,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:07:52,611 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:07:52,611 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 04:07:52,611 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 04:07:52,611 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 04:07:52,611 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 04:07:52,611 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 04:07:52,611 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 04:07:52,611 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 04:07:52,612 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 04:07:52,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:07:52,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:07:52,612 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:07:52,612 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:07:52,612 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:07:52,613 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:07:52,613 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:07:52,613 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:07:52,613 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:07:52,613 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:07:52,613 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:07:52,613 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:07:52,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:07:52,614 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 04:07:52,614 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_a1336054-a6c8-44f2-b76f-0cf735ad65e7/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-11-10 04:07:52,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:07:52,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:07:52,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:07:52,647 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:07:52,647 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:07:52,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 04:07:52,683 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/data/7bc1329f6/53ad0bc7bd6b4f8c85810c2302f539b2/FLAG1125b519d [2018-11-10 04:07:53,104 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:07:53,104 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 04:07:53,110 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/data/7bc1329f6/53ad0bc7bd6b4f8c85810c2302f539b2/FLAG1125b519d [2018-11-10 04:07:53,122 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/data/7bc1329f6/53ad0bc7bd6b4f8c85810c2302f539b2 [2018-11-10 04:07:53,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:07:53,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:07:53,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:07:53,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:07:53,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:07:53,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53, skipping insertion in model container [2018-11-10 04:07:53,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:07:53,156 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:07:53,272 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:07:53,275 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:07:53,292 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:07:53,302 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:07:53,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53 WrapperNode [2018-11-10 04:07:53,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:07:53,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:07:53,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:07:53,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:07:53,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:07:53,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:07:53,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:07:53,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:07:53,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... [2018-11-10 04:07:53,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:07:53,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:07:53,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:07:53,333 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:07:53,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/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-11-10 04:07:53,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:07:53,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:07:53,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:07:53,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:07:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:07:53,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:07:53,563 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:07:53,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:07:53 BoogieIcfgContainer [2018-11-10 04:07:53,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:07:53,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:07:53,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:07:53,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:07:53,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:07:53" (1/3) ... [2018-11-10 04:07:53,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce62db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:07:53, skipping insertion in model container [2018-11-10 04:07:53,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:07:53" (2/3) ... [2018-11-10 04:07:53,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce62db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:07:53, skipping insertion in model container [2018-11-10 04:07:53,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:07:53" (3/3) ... [2018-11-10 04:07:53,569 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 04:07:53,575 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:07:53,580 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:07:53,589 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:07:53,615 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:07:53,615 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:07:53,615 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:07:53,616 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:07:53,616 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:07:53,616 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:07:53,616 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:07:53,616 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:07:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-10 04:07:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 04:07:53,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:53,635 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:07:53,636 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:53,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash -811584747, now seen corresponding path program 1 times [2018-11-10 04:07:53,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:53,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:53,679 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:53,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:53,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:53,763 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:53,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:53,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:53,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:53,777 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-10 04:07:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:53,814 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2018-11-10 04:07:53,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:53,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 04:07:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:53,822 INFO L225 Difference]: With dead ends: 83 [2018-11-10 04:07:53,822 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 04:07:53,824 INFO L605 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-11-10 04:07:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 04:07:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-11-10 04:07:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 04:07:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2018-11-10 04:07:53,849 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2018-11-10 04:07:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:53,850 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2018-11-10 04:07:53,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2018-11-10 04:07:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 04:07:53,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:53,851 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:07:53,851 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:53,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:53,851 INFO L82 PathProgramCache]: Analyzing trace with hash -553419309, now seen corresponding path program 1 times [2018-11-10 04:07:53,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:53,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:53,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:53,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:53,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:53,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:53,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:53,886 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:53,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:53,889 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand 3 states. [2018-11-10 04:07:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:53,914 INFO L93 Difference]: Finished difference Result 110 states and 195 transitions. [2018-11-10 04:07:53,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:53,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 04:07:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:53,916 INFO L225 Difference]: With dead ends: 110 [2018-11-10 04:07:53,916 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 04:07:53,917 INFO L605 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-11-10 04:07:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 04:07:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-10 04:07:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 04:07:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 115 transitions. [2018-11-10 04:07:53,922 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 115 transitions. Word has length 20 [2018-11-10 04:07:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:53,922 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 115 transitions. [2018-11-10 04:07:53,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 115 transitions. [2018-11-10 04:07:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 04:07:53,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:53,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:07:53,923 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:53,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash 610890324, now seen corresponding path program 1 times [2018-11-10 04:07:53,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:53,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:53,924 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:53,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:53,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:53,967 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:53,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:53,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:53,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:53,967 INFO L87 Difference]: Start difference. First operand 66 states and 115 transitions. Second operand 3 states. [2018-11-10 04:07:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:53,987 INFO L93 Difference]: Finished difference Result 103 states and 175 transitions. [2018-11-10 04:07:53,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:53,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 04:07:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:53,988 INFO L225 Difference]: With dead ends: 103 [2018-11-10 04:07:53,988 INFO L226 Difference]: Without dead ends: 72 [2018-11-10 04:07:53,988 INFO L605 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-11-10 04:07:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-10 04:07:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-10 04:07:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 04:07:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2018-11-10 04:07:53,995 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 21 [2018-11-10 04:07:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:53,995 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 118 transitions. [2018-11-10 04:07:53,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-11-10 04:07:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 04:07:53,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:53,996 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:07:53,997 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:53,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 24084310, now seen corresponding path program 1 times [2018-11-10 04:07:53,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:53,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:53,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:53,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,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-11-10 04:07:54,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,027 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,028 INFO L87 Difference]: Start difference. First operand 70 states and 118 transitions. Second operand 3 states. [2018-11-10 04:07:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,054 INFO L93 Difference]: Finished difference Result 129 states and 221 transitions. [2018-11-10 04:07:54,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 04:07:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,056 INFO L225 Difference]: With dead ends: 129 [2018-11-10 04:07:54,056 INFO L226 Difference]: Without dead ends: 127 [2018-11-10 04:07:54,057 INFO L605 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-11-10 04:07:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-10 04:07:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-11-10 04:07:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 04:07:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 155 transitions. [2018-11-10 04:07:54,064 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 155 transitions. Word has length 21 [2018-11-10 04:07:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,064 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 155 transitions. [2018-11-10 04:07:54,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 155 transitions. [2018-11-10 04:07:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 04:07:54,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:07:54,065 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,065 INFO L82 PathProgramCache]: Analyzing trace with hash 282249748, now seen corresponding path program 1 times [2018-11-10 04:07:54,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,085 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,086 INFO L87 Difference]: Start difference. First operand 91 states and 155 transitions. Second operand 3 states. [2018-11-10 04:07:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,103 INFO L93 Difference]: Finished difference Result 211 states and 365 transitions. [2018-11-10 04:07:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 04:07:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,104 INFO L225 Difference]: With dead ends: 211 [2018-11-10 04:07:54,104 INFO L226 Difference]: Without dead ends: 129 [2018-11-10 04:07:54,105 INFO L605 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-11-10 04:07:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-10 04:07:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-11-10 04:07:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 04:07:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 215 transitions. [2018-11-10 04:07:54,115 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 215 transitions. Word has length 21 [2018-11-10 04:07:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,115 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 215 transitions. [2018-11-10 04:07:54,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 215 transitions. [2018-11-10 04:07:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 04:07:54,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,116 INFO L375 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] [2018-11-10 04:07:54,116 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash 746827656, now seen corresponding path program 1 times [2018-11-10 04:07:54,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,150 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,151 INFO L87 Difference]: Start difference. First operand 127 states and 215 transitions. Second operand 3 states. [2018-11-10 04:07:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,164 INFO L93 Difference]: Finished difference Result 190 states and 320 transitions. [2018-11-10 04:07:54,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 04:07:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,165 INFO L225 Difference]: With dead ends: 190 [2018-11-10 04:07:54,165 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 04:07:54,165 INFO L605 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-11-10 04:07:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 04:07:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-11-10 04:07:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-10 04:07:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 215 transitions. [2018-11-10 04:07:54,174 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 215 transitions. Word has length 22 [2018-11-10 04:07:54,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,174 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 215 transitions. [2018-11-10 04:07:54,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 215 transitions. [2018-11-10 04:07:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 04:07:54,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,175 INFO L375 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] [2018-11-10 04:07:54,175 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash 160021642, now seen corresponding path program 1 times [2018-11-10 04:07:54,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,204 INFO L87 Difference]: Start difference. First operand 129 states and 215 transitions. Second operand 3 states. [2018-11-10 04:07:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,223 INFO L93 Difference]: Finished difference Result 237 states and 401 transitions. [2018-11-10 04:07:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 04:07:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,225 INFO L225 Difference]: With dead ends: 237 [2018-11-10 04:07:54,225 INFO L226 Difference]: Without dead ends: 235 [2018-11-10 04:07:54,225 INFO L605 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-11-10 04:07:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-10 04:07:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 173. [2018-11-10 04:07:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 04:07:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 287 transitions. [2018-11-10 04:07:54,233 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 287 transitions. Word has length 22 [2018-11-10 04:07:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,234 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 287 transitions. [2018-11-10 04:07:54,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 287 transitions. [2018-11-10 04:07:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 04:07:54,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,235 INFO L375 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] [2018-11-10 04:07:54,235 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash 418187080, now seen corresponding path program 1 times [2018-11-10 04:07:54,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,256 INFO L87 Difference]: Start difference. First operand 173 states and 287 transitions. Second operand 3 states. [2018-11-10 04:07:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,282 INFO L93 Difference]: Finished difference Result 405 states and 677 transitions. [2018-11-10 04:07:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 04:07:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,283 INFO L225 Difference]: With dead ends: 405 [2018-11-10 04:07:54,283 INFO L226 Difference]: Without dead ends: 243 [2018-11-10 04:07:54,284 INFO L605 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-11-10 04:07:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-10 04:07:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-11-10 04:07:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-10 04:07:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 395 transitions. [2018-11-10 04:07:54,295 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 395 transitions. Word has length 22 [2018-11-10 04:07:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,295 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 395 transitions. [2018-11-10 04:07:54,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 395 transitions. [2018-11-10 04:07:54,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:07:54,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,296 INFO L375 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] [2018-11-10 04:07:54,297 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,297 INFO L82 PathProgramCache]: Analyzing trace with hash 665917993, now seen corresponding path program 1 times [2018-11-10 04:07:54,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,323 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,323 INFO L87 Difference]: Start difference. First operand 241 states and 395 transitions. Second operand 3 states. [2018-11-10 04:07:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,338 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2018-11-10 04:07:54,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 04:07:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,339 INFO L225 Difference]: With dead ends: 361 [2018-11-10 04:07:54,339 INFO L226 Difference]: Without dead ends: 247 [2018-11-10 04:07:54,340 INFO L605 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-11-10 04:07:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-10 04:07:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-11-10 04:07:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-10 04:07:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 395 transitions. [2018-11-10 04:07:54,346 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 395 transitions. Word has length 23 [2018-11-10 04:07:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,346 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 395 transitions. [2018-11-10 04:07:54,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 395 transitions. [2018-11-10 04:07:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:07:54,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,347 INFO L375 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] [2018-11-10 04:07:54,347 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,347 INFO L82 PathProgramCache]: Analyzing trace with hash 79111979, now seen corresponding path program 1 times [2018-11-10 04:07:54,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,348 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,374 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,375 INFO L87 Difference]: Start difference. First operand 245 states and 395 transitions. Second operand 3 states. [2018-11-10 04:07:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,398 INFO L93 Difference]: Finished difference Result 445 states and 729 transitions. [2018-11-10 04:07:54,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 04:07:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,399 INFO L225 Difference]: With dead ends: 445 [2018-11-10 04:07:54,399 INFO L226 Difference]: Without dead ends: 443 [2018-11-10 04:07:54,400 INFO L605 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-11-10 04:07:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-10 04:07:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 337. [2018-11-10 04:07:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-10 04:07:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 535 transitions. [2018-11-10 04:07:54,406 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 535 transitions. Word has length 23 [2018-11-10 04:07:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,407 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 535 transitions. [2018-11-10 04:07:54,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 535 transitions. [2018-11-10 04:07:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:07:54,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,408 INFO L375 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] [2018-11-10 04:07:54,408 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash 337277417, now seen corresponding path program 1 times [2018-11-10 04:07:54,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,409 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,431 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,431 INFO L87 Difference]: Start difference. First operand 337 states and 535 transitions. Second operand 3 states. [2018-11-10 04:07:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,459 INFO L93 Difference]: Finished difference Result 789 states and 1257 transitions. [2018-11-10 04:07:54,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 04:07:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,461 INFO L225 Difference]: With dead ends: 789 [2018-11-10 04:07:54,461 INFO L226 Difference]: Without dead ends: 467 [2018-11-10 04:07:54,462 INFO L605 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-11-10 04:07:54,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-11-10 04:07:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2018-11-10 04:07:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-10 04:07:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 727 transitions. [2018-11-10 04:07:54,477 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 727 transitions. Word has length 23 [2018-11-10 04:07:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,477 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 727 transitions. [2018-11-10 04:07:54,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 727 transitions. [2018-11-10 04:07:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 04:07:54,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,478 INFO L375 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] [2018-11-10 04:07:54,478 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1842281219, now seen corresponding path program 1 times [2018-11-10 04:07:54,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,480 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,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-11-10 04:07:54,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,496 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,497 INFO L87 Difference]: Start difference. First operand 465 states and 727 transitions. Second operand 3 states. [2018-11-10 04:07:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,526 INFO L93 Difference]: Finished difference Result 697 states and 1085 transitions. [2018-11-10 04:07:54,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 04:07:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,528 INFO L225 Difference]: With dead ends: 697 [2018-11-10 04:07:54,528 INFO L226 Difference]: Without dead ends: 475 [2018-11-10 04:07:54,529 INFO L605 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-11-10 04:07:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-11-10 04:07:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 473. [2018-11-10 04:07:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-11-10 04:07:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 727 transitions. [2018-11-10 04:07:54,543 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 727 transitions. Word has length 24 [2018-11-10 04:07:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,544 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 727 transitions. [2018-11-10 04:07:54,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 727 transitions. [2018-11-10 04:07:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 04:07:54,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,545 INFO L375 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] [2018-11-10 04:07:54,545 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1865880063, now seen corresponding path program 1 times [2018-11-10 04:07:54,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,563 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,564 INFO L87 Difference]: Start difference. First operand 473 states and 727 transitions. Second operand 3 states. [2018-11-10 04:07:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,598 INFO L93 Difference]: Finished difference Result 1357 states and 2073 transitions. [2018-11-10 04:07:54,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 04:07:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,601 INFO L225 Difference]: With dead ends: 1357 [2018-11-10 04:07:54,601 INFO L226 Difference]: Without dead ends: 907 [2018-11-10 04:07:54,602 INFO L605 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-11-10 04:07:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-10 04:07:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 905. [2018-11-10 04:07:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-11-10 04:07:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1351 transitions. [2018-11-10 04:07:54,619 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1351 transitions. Word has length 24 [2018-11-10 04:07:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,620 INFO L481 AbstractCegarLoop]: Abstraction has 905 states and 1351 transitions. [2018-11-10 04:07:54,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1351 transitions. [2018-11-10 04:07:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 04:07:54,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,621 INFO L375 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] [2018-11-10 04:07:54,621 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1607714625, now seen corresponding path program 1 times [2018-11-10 04:07:54,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,643 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,643 INFO L87 Difference]: Start difference. First operand 905 states and 1351 transitions. Second operand 3 states. [2018-11-10 04:07:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,663 INFO L93 Difference]: Finished difference Result 1085 states and 1657 transitions. [2018-11-10 04:07:54,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 04:07:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,666 INFO L225 Difference]: With dead ends: 1085 [2018-11-10 04:07:54,666 INFO L226 Difference]: Without dead ends: 1083 [2018-11-10 04:07:54,667 INFO L605 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-11-10 04:07:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-11-10 04:07:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 905. [2018-11-10 04:07:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-11-10 04:07:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1335 transitions. [2018-11-10 04:07:54,685 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1335 transitions. Word has length 24 [2018-11-10 04:07:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,685 INFO L481 AbstractCegarLoop]: Abstraction has 905 states and 1335 transitions. [2018-11-10 04:07:54,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1335 transitions. [2018-11-10 04:07:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:07:54,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,686 INFO L375 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] [2018-11-10 04:07:54,687 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2007922174, now seen corresponding path program 1 times [2018-11-10 04:07:54,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,706 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,707 INFO L87 Difference]: Start difference. First operand 905 states and 1335 transitions. Second operand 3 states. [2018-11-10 04:07:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,736 INFO L93 Difference]: Finished difference Result 1597 states and 2393 transitions. [2018-11-10 04:07:54,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 04:07:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,740 INFO L225 Difference]: With dead ends: 1597 [2018-11-10 04:07:54,740 INFO L226 Difference]: Without dead ends: 1595 [2018-11-10 04:07:54,740 INFO L605 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-11-10 04:07:54,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-10 04:07:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1305. [2018-11-10 04:07:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-11-10 04:07:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1879 transitions. [2018-11-10 04:07:54,766 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1879 transitions. Word has length 25 [2018-11-10 04:07:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,766 INFO L481 AbstractCegarLoop]: Abstraction has 1305 states and 1879 transitions. [2018-11-10 04:07:54,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1879 transitions. [2018-11-10 04:07:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:07:54,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,768 INFO L375 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] [2018-11-10 04:07:54,768 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2028879684, now seen corresponding path program 1 times [2018-11-10 04:07:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,770 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,787 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,788 INFO L87 Difference]: Start difference. First operand 1305 states and 1879 transitions. Second operand 3 states. [2018-11-10 04:07:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,821 INFO L93 Difference]: Finished difference Result 3037 states and 4377 transitions. [2018-11-10 04:07:54,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 04:07:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,824 INFO L225 Difference]: With dead ends: 3037 [2018-11-10 04:07:54,824 INFO L226 Difference]: Without dead ends: 1755 [2018-11-10 04:07:54,826 INFO L605 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-11-10 04:07:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2018-11-10 04:07:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2018-11-10 04:07:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-11-10 04:07:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2471 transitions. [2018-11-10 04:07:54,862 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2471 transitions. Word has length 25 [2018-11-10 04:07:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,862 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2471 transitions. [2018-11-10 04:07:54,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2471 transitions. [2018-11-10 04:07:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 04:07:54,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,864 INFO L375 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] [2018-11-10 04:07:54,864 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2116260660, now seen corresponding path program 1 times [2018-11-10 04:07:54,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,883 INFO L87 Difference]: Start difference. First operand 1753 states and 2471 transitions. Second operand 3 states. [2018-11-10 04:07:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:54,928 INFO L93 Difference]: Finished difference Result 2653 states and 3737 transitions. [2018-11-10 04:07:54,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:54,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 04:07:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:54,932 INFO L225 Difference]: With dead ends: 2653 [2018-11-10 04:07:54,932 INFO L226 Difference]: Without dead ends: 1803 [2018-11-10 04:07:54,933 INFO L605 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-11-10 04:07:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-11-10 04:07:54,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2018-11-10 04:07:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1801 states. [2018-11-10 04:07:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2503 transitions. [2018-11-10 04:07:54,962 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2503 transitions. Word has length 26 [2018-11-10 04:07:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:54,962 INFO L481 AbstractCegarLoop]: Abstraction has 1801 states and 2503 transitions. [2018-11-10 04:07:54,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2503 transitions. [2018-11-10 04:07:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 04:07:54,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:54,964 INFO L375 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] [2018-11-10 04:07:54,964 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:54,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1529454646, now seen corresponding path program 1 times [2018-11-10 04:07:54,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:54,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:54,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:54,966 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:54,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:54,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:54,982 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:54,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:54,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:54,983 INFO L87 Difference]: Start difference. First operand 1801 states and 2503 transitions. Second operand 3 states. [2018-11-10 04:07:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:55,024 INFO L93 Difference]: Finished difference Result 3085 states and 4329 transitions. [2018-11-10 04:07:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:55,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 04:07:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:55,029 INFO L225 Difference]: With dead ends: 3085 [2018-11-10 04:07:55,029 INFO L226 Difference]: Without dead ends: 3083 [2018-11-10 04:07:55,030 INFO L605 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-11-10 04:07:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-10 04:07:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2633. [2018-11-10 04:07:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2018-11-10 04:07:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3559 transitions. [2018-11-10 04:07:55,072 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3559 transitions. Word has length 26 [2018-11-10 04:07:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:55,072 INFO L481 AbstractCegarLoop]: Abstraction has 2633 states and 3559 transitions. [2018-11-10 04:07:55,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3559 transitions. [2018-11-10 04:07:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 04:07:55,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:55,075 INFO L375 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] [2018-11-10 04:07:55,075 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:55,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1787620084, now seen corresponding path program 1 times [2018-11-10 04:07:55,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:55,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:55,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:55,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:55,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:55,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:55,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:55,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:55,087 INFO L87 Difference]: Start difference. First operand 2633 states and 3559 transitions. Second operand 3 states. [2018-11-10 04:07:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:55,146 INFO L93 Difference]: Finished difference Result 6029 states and 8105 transitions. [2018-11-10 04:07:55,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:55,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 04:07:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:55,153 INFO L225 Difference]: With dead ends: 6029 [2018-11-10 04:07:55,153 INFO L226 Difference]: Without dead ends: 3467 [2018-11-10 04:07:55,156 INFO L605 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-11-10 04:07:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-10 04:07:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3465. [2018-11-10 04:07:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3465 states. [2018-11-10 04:07:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4551 transitions. [2018-11-10 04:07:55,216 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4551 transitions. Word has length 26 [2018-11-10 04:07:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:55,216 INFO L481 AbstractCegarLoop]: Abstraction has 3465 states and 4551 transitions. [2018-11-10 04:07:55,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4551 transitions. [2018-11-10 04:07:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:07:55,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:55,219 INFO L375 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] [2018-11-10 04:07:55,219 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:55,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash 168669521, now seen corresponding path program 1 times [2018-11-10 04:07:55,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:55,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:55,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:55,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:55,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:55,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:55,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:55,243 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:55,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:55,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:55,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:55,243 INFO L87 Difference]: Start difference. First operand 3465 states and 4551 transitions. Second operand 3 states. [2018-11-10 04:07:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:55,293 INFO L93 Difference]: Finished difference Result 5197 states and 6793 transitions. [2018-11-10 04:07:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:55,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 04:07:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:55,299 INFO L225 Difference]: With dead ends: 5197 [2018-11-10 04:07:55,299 INFO L226 Difference]: Without dead ends: 3531 [2018-11-10 04:07:55,301 INFO L605 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-11-10 04:07:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2018-11-10 04:07:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3529. [2018-11-10 04:07:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-11-10 04:07:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4551 transitions. [2018-11-10 04:07:55,360 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4551 transitions. Word has length 27 [2018-11-10 04:07:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:55,360 INFO L481 AbstractCegarLoop]: Abstraction has 3529 states and 4551 transitions. [2018-11-10 04:07:55,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4551 transitions. [2018-11-10 04:07:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:07:55,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:55,363 INFO L375 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] [2018-11-10 04:07:55,363 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:55,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:55,363 INFO L82 PathProgramCache]: Analyzing trace with hash -418136493, now seen corresponding path program 1 times [2018-11-10 04:07:55,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:55,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:55,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:55,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:55,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:55,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:55,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:55,383 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:55,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:55,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:55,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:55,383 INFO L87 Difference]: Start difference. First operand 3529 states and 4551 transitions. Second operand 3 states. [2018-11-10 04:07:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:55,453 INFO L93 Difference]: Finished difference Result 5901 states and 7625 transitions. [2018-11-10 04:07:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:55,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 04:07:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:55,464 INFO L225 Difference]: With dead ends: 5901 [2018-11-10 04:07:55,464 INFO L226 Difference]: Without dead ends: 5899 [2018-11-10 04:07:55,466 INFO L605 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-11-10 04:07:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2018-11-10 04:07:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 5257. [2018-11-10 04:07:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5257 states. [2018-11-10 04:07:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 6599 transitions. [2018-11-10 04:07:55,611 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 6599 transitions. Word has length 27 [2018-11-10 04:07:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:55,611 INFO L481 AbstractCegarLoop]: Abstraction has 5257 states and 6599 transitions. [2018-11-10 04:07:55,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 6599 transitions. [2018-11-10 04:07:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:07:55,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:55,617 INFO L375 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] [2018-11-10 04:07:55,618 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:55,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:55,618 INFO L82 PathProgramCache]: Analyzing trace with hash -159971055, now seen corresponding path program 1 times [2018-11-10 04:07:55,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:55,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:55,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:55,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:55,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:55,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:55,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:55,646 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:55,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:55,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:55,647 INFO L87 Difference]: Start difference. First operand 5257 states and 6599 transitions. Second operand 3 states. [2018-11-10 04:07:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:55,784 INFO L93 Difference]: Finished difference Result 11917 states and 14793 transitions. [2018-11-10 04:07:55,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:55,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 04:07:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:55,795 INFO L225 Difference]: With dead ends: 11917 [2018-11-10 04:07:55,795 INFO L226 Difference]: Without dead ends: 6795 [2018-11-10 04:07:55,802 INFO L605 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-11-10 04:07:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6795 states. [2018-11-10 04:07:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6795 to 6793. [2018-11-10 04:07:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-11-10 04:07:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 8199 transitions. [2018-11-10 04:07:55,994 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 8199 transitions. Word has length 27 [2018-11-10 04:07:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:55,994 INFO L481 AbstractCegarLoop]: Abstraction has 6793 states and 8199 transitions. [2018-11-10 04:07:55,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 8199 transitions. [2018-11-10 04:07:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:07:56,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:56,000 INFO L375 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] [2018-11-10 04:07:56,001 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:56,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:56,001 INFO L82 PathProgramCache]: Analyzing trace with hash -77113303, now seen corresponding path program 1 times [2018-11-10 04:07:56,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:56,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:56,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:56,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:56,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:56,014 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:56,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:56,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:56,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:56,015 INFO L87 Difference]: Start difference. First operand 6793 states and 8199 transitions. Second operand 3 states. [2018-11-10 04:07:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:56,143 INFO L93 Difference]: Finished difference Result 10189 states and 12233 transitions. [2018-11-10 04:07:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:56,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 04:07:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:56,154 INFO L225 Difference]: With dead ends: 10189 [2018-11-10 04:07:56,154 INFO L226 Difference]: Without dead ends: 6923 [2018-11-10 04:07:56,159 INFO L605 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-11-10 04:07:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2018-11-10 04:07:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 6921. [2018-11-10 04:07:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6921 states. [2018-11-10 04:07:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 8199 transitions. [2018-11-10 04:07:56,344 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 8199 transitions. Word has length 28 [2018-11-10 04:07:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:56,345 INFO L481 AbstractCegarLoop]: Abstraction has 6921 states and 8199 transitions. [2018-11-10 04:07:56,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 8199 transitions. [2018-11-10 04:07:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:07:56,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:56,351 INFO L375 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] [2018-11-10 04:07:56,351 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:56,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:56,351 INFO L82 PathProgramCache]: Analyzing trace with hash -663919317, now seen corresponding path program 1 times [2018-11-10 04:07:56,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:56,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:56,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:56,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:56,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:56,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:56,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:56,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:56,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:56,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:56,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:56,386 INFO L87 Difference]: Start difference. First operand 6921 states and 8199 transitions. Second operand 3 states. [2018-11-10 04:07:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:56,582 INFO L93 Difference]: Finished difference Result 11275 states and 13192 transitions. [2018-11-10 04:07:56,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:56,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 04:07:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:56,597 INFO L225 Difference]: With dead ends: 11275 [2018-11-10 04:07:56,597 INFO L226 Difference]: Without dead ends: 11273 [2018-11-10 04:07:56,601 INFO L605 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-11-10 04:07:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2018-11-10 04:07:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 10505. [2018-11-10 04:07:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10505 states. [2018-11-10 04:07:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 12167 transitions. [2018-11-10 04:07:56,807 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 12167 transitions. Word has length 28 [2018-11-10 04:07:56,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:56,808 INFO L481 AbstractCegarLoop]: Abstraction has 10505 states and 12167 transitions. [2018-11-10 04:07:56,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 12167 transitions. [2018-11-10 04:07:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:07:56,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:56,819 INFO L375 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] [2018-11-10 04:07:56,820 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:56,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:56,820 INFO L82 PathProgramCache]: Analyzing trace with hash -405753879, now seen corresponding path program 1 times [2018-11-10 04:07:56,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:56,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:56,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:56,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:56,821 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:07:56,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:07:56,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:07:56,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:56,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:07:56,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:07:56,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:07:56,851 INFO L87 Difference]: Start difference. First operand 10505 states and 12167 transitions. Second operand 3 states. [2018-11-10 04:07:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:57,080 INFO L93 Difference]: Finished difference Result 23561 states and 26759 transitions. [2018-11-10 04:07:57,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:07:57,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 04:07:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:57,081 INFO L225 Difference]: With dead ends: 23561 [2018-11-10 04:07:57,081 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 04:07:57,103 INFO L605 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-11-10 04:07:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 04:07:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 04:07:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 04:07:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:07:57,103 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-10 04:07:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:57,103 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:07:57,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:07:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:07:57,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:07:57,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 04:07:57,137 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 04:07:57,137 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:07:57,137 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:07:57,137 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 04:07:57,137 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:07:57,137 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:07:57,137 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,137 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-11-10 04:07:57,137 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,137 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L428 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-10 04:07:57,138 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L428 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L421 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 04:07:57,139 INFO L425 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-11-10 04:07:57,140 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,140 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-11-10 04:07:57,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:07:57 BoogieIcfgContainer [2018-11-10 04:07:57,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:07:57,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:07:57,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:07:57,146 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:07:57,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:07:53" (3/4) ... [2018-11-10 04:07:57,149 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:07:57,155 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 04:07:57,155 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 04:07:57,160 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 04:07:57,160 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 04:07:57,160 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 04:07:57,203 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a1336054-a6c8-44f2-b76f-0cf735ad65e7/bin-2019/utaipan/witness.graphml [2018-11-10 04:07:57,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:07:57,203 INFO L168 Benchmark]: Toolchain (without parser) took 4078.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 960.3 MB in the beginning and 866.4 MB in the end (delta: 93.9 MB). Peak memory consumption was 290.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:57,205 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:07:57,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.91 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:57,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.95 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:57,206 INFO L168 Benchmark]: Boogie Preprocessor took 16.81 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:07:57,206 INFO L168 Benchmark]: RCFGBuilder took 231.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:57,206 INFO L168 Benchmark]: TraceAbstraction took 3581.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 872.8 MB in the end (delta: 247.0 MB). Peak memory consumption was 303.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:57,207 INFO L168 Benchmark]: Witness Printer took 57.47 ms. Allocated memory is still 1.2 GB. Free memory was 872.8 MB in the beginning and 866.4 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:57,208 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.91 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.95 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.81 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 231.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3581.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 872.8 MB in the end (delta: 247.0 MB). Peak memory consumption was 303.6 MB. Max. memory is 11.5 GB. * Witness Printer took 57.47 ms. Allocated memory is still 1.2 GB. Free memory was 872.8 MB in the beginning and 866.4 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1990 SDtfs, 948 SDslu, 1336 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10505occurred in iteration=24, 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: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2583 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 25820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...