./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_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/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_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/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-10-27 00:43:14,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:43:14,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:43:14,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:43:14,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:43:14,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:43:14,862 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:43:14,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:43:14,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:43:14,865 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:43:14,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:43:14,866 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:43:14,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:43:14,867 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:43:14,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:43:14,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:43:14,869 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:43:14,871 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:43:14,872 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:43:14,873 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:43:14,874 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:43:14,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:43:14,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:43:14,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:43:14,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:43:14,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:43:14,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:43:14,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:43:14,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:43:14,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:43:14,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:43:14,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:43:14,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:43:14,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:43:14,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:43:14,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:43:14,884 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-27 00:43:14,894 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:43:14,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:43:14,895 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:43:14,895 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:43:14,895 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:43:14,896 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:43:14,896 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:43:14,896 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:43:14,896 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:43:14,896 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:43:14,896 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:43:14,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:43:14,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:43:14,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:43:14,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:43:14,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:43:14,897 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:43:14,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:43:14,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:43:14,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:43:14,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:43:14,898 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:43:14,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:43:14,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:43:14,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:43:14,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:43:14,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:43:14,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:43:14,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:43:14,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:43:14,901 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:43:14,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:43:14,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:43:14,902 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:43:14,902 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_e40455c4-37ff-4f56-87f4-c839cc48b057/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-10-27 00:43:14,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:43:14,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:43:14,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:43:14,949 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:43:14,949 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:43:14,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-27 00:43:14,998 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/data/09adfd5c1/bae5e148b02b49d890ed77d46c3cf65a/FLAG451d07068 [2018-10-27 00:43:15,359 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:43:15,360 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-27 00:43:15,366 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/data/09adfd5c1/bae5e148b02b49d890ed77d46c3cf65a/FLAG451d07068 [2018-10-27 00:43:15,375 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/data/09adfd5c1/bae5e148b02b49d890ed77d46c3cf65a [2018-10-27 00:43:15,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:43:15,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:43:15,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:43:15,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:43:15,382 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:43:15,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f0132f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15, skipping insertion in model container [2018-10-27 00:43:15,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:43:15,410 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:43:15,529 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:43:15,531 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:43:15,548 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:43:15,558 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:43:15,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15 WrapperNode [2018-10-27 00:43:15,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:43:15,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:43:15,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:43:15,560 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:43:15,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:43:15,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:43:15,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:43:15,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:43:15,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... [2018-10-27 00:43:15,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:43:15,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:43:15,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:43:15,599 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:43:15,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/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-10-27 00:43:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:43:15,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:43:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:43:15,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:43:15,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:43:15,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:43:16,237 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:43:16,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:43:16 BoogieIcfgContainer [2018-10-27 00:43:16,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:43:16,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:43:16,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:43:16,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:43:16,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:43:15" (1/3) ... [2018-10-27 00:43:16,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1624d82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:43:16, skipping insertion in model container [2018-10-27 00:43:16,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:43:15" (2/3) ... [2018-10-27 00:43:16,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1624d82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:43:16, skipping insertion in model container [2018-10-27 00:43:16,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:43:16" (3/3) ... [2018-10-27 00:43:16,244 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-27 00:43:16,252 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:43:16,258 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:43:16,271 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:43:16,297 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:43:16,298 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:43:16,298 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:43:16,298 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:43:16,298 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:43:16,298 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:43:16,298 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:43:16,298 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:43:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-10-27 00:43:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 00:43:16,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:16,318 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-10-27 00:43:16,320 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:16,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash -811584747, now seen corresponding path program 1 times [2018-10-27 00:43:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:16,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:16,368 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:16,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:16,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:16,533 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:16,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:16,545 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-10-27 00:43:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:16,590 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2018-10-27 00:43:16,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:16,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-27 00:43:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:16,599 INFO L225 Difference]: With dead ends: 83 [2018-10-27 00:43:16,599 INFO L226 Difference]: Without dead ends: 68 [2018-10-27 00:43:16,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-10-27 00:43:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-27 00:43:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-10-27 00:43:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-27 00:43:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2018-10-27 00:43:16,637 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2018-10-27 00:43:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:16,638 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2018-10-27 00:43:16,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2018-10-27 00:43:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 00:43:16,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:16,639 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-10-27 00:43:16,639 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:16,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -553419309, now seen corresponding path program 1 times [2018-10-27 00:43:16,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:16,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:16,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:16,641 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:16,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:16,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:16,700 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:16,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:16,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:16,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:16,701 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand 3 states. [2018-10-27 00:43:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:16,753 INFO L93 Difference]: Finished difference Result 110 states and 195 transitions. [2018-10-27 00:43:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:16,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-27 00:43:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:16,755 INFO L225 Difference]: With dead ends: 110 [2018-10-27 00:43:16,755 INFO L226 Difference]: Without dead ends: 68 [2018-10-27 00:43:16,756 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-10-27 00:43:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-27 00:43:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-10-27 00:43:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-27 00:43:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 115 transitions. [2018-10-27 00:43:16,763 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 115 transitions. Word has length 20 [2018-10-27 00:43:16,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:16,763 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 115 transitions. [2018-10-27 00:43:16,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 115 transitions. [2018-10-27 00:43:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 00:43:16,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:16,764 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-10-27 00:43:16,764 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:16,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash 610890324, now seen corresponding path program 1 times [2018-10-27 00:43:16,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:16,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:16,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:16,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:16,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:16,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:16,825 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:16,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:16,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:16,826 INFO L87 Difference]: Start difference. First operand 66 states and 115 transitions. Second operand 3 states. [2018-10-27 00:43:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:16,893 INFO L93 Difference]: Finished difference Result 103 states and 175 transitions. [2018-10-27 00:43:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:16,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-27 00:43:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:16,896 INFO L225 Difference]: With dead ends: 103 [2018-10-27 00:43:16,896 INFO L226 Difference]: Without dead ends: 72 [2018-10-27 00:43:16,896 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-10-27 00:43:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-27 00:43:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-10-27 00:43:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 00:43:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2018-10-27 00:43:16,905 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 21 [2018-10-27 00:43:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:16,905 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 118 transitions. [2018-10-27 00:43:16,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-10-27 00:43:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 00:43:16,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:16,906 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-10-27 00:43:16,906 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:16,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:16,906 INFO L82 PathProgramCache]: Analyzing trace with hash 24084310, now seen corresponding path program 1 times [2018-10-27 00:43:16,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:16,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:16,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:16,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:16,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:16,977 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:16,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:16,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:16,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:16,977 INFO L87 Difference]: Start difference. First operand 70 states and 118 transitions. Second operand 3 states. [2018-10-27 00:43:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:17,008 INFO L93 Difference]: Finished difference Result 129 states and 221 transitions. [2018-10-27 00:43:17,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:17,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-27 00:43:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:17,009 INFO L225 Difference]: With dead ends: 129 [2018-10-27 00:43:17,009 INFO L226 Difference]: Without dead ends: 127 [2018-10-27 00:43:17,010 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-10-27 00:43:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-27 00:43:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-10-27 00:43:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-27 00:43:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 155 transitions. [2018-10-27 00:43:17,019 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 155 transitions. Word has length 21 [2018-10-27 00:43:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:17,019 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 155 transitions. [2018-10-27 00:43:17,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 155 transitions. [2018-10-27 00:43:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 00:43:17,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:17,020 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-10-27 00:43:17,020 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:17,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:17,021 INFO L82 PathProgramCache]: Analyzing trace with hash 282249748, now seen corresponding path program 1 times [2018-10-27 00:43:17,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:17,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:17,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:17,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:17,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:17,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:17,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:17,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:17,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:17,078 INFO L87 Difference]: Start difference. First operand 91 states and 155 transitions. Second operand 3 states. [2018-10-27 00:43:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:17,116 INFO L93 Difference]: Finished difference Result 211 states and 365 transitions. [2018-10-27 00:43:17,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:17,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-27 00:43:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:17,117 INFO L225 Difference]: With dead ends: 211 [2018-10-27 00:43:17,117 INFO L226 Difference]: Without dead ends: 129 [2018-10-27 00:43:17,118 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-10-27 00:43:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-27 00:43:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-27 00:43:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-27 00:43:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 215 transitions. [2018-10-27 00:43:17,127 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 215 transitions. Word has length 21 [2018-10-27 00:43:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:17,127 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 215 transitions. [2018-10-27 00:43:17,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 215 transitions. [2018-10-27 00:43:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 00:43:17,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:17,128 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-10-27 00:43:17,129 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:17,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:17,129 INFO L82 PathProgramCache]: Analyzing trace with hash 746827656, now seen corresponding path program 1 times [2018-10-27 00:43:17,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:17,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:17,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:17,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:17,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:17,166 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:17,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:17,167 INFO L87 Difference]: Start difference. First operand 127 states and 215 transitions. Second operand 3 states. [2018-10-27 00:43:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:17,190 INFO L93 Difference]: Finished difference Result 190 states and 320 transitions. [2018-10-27 00:43:17,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:17,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-27 00:43:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:17,191 INFO L225 Difference]: With dead ends: 190 [2018-10-27 00:43:17,192 INFO L226 Difference]: Without dead ends: 131 [2018-10-27 00:43:17,192 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-10-27 00:43:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-27 00:43:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-10-27 00:43:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-27 00:43:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 215 transitions. [2018-10-27 00:43:17,200 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 215 transitions. Word has length 22 [2018-10-27 00:43:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:17,200 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 215 transitions. [2018-10-27 00:43:17,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 215 transitions. [2018-10-27 00:43:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 00:43:17,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:17,201 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-10-27 00:43:17,201 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:17,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:17,201 INFO L82 PathProgramCache]: Analyzing trace with hash 160021642, now seen corresponding path program 1 times [2018-10-27 00:43:17,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:17,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:17,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,203 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:17,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:17,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:17,252 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:17,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:17,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:17,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:17,253 INFO L87 Difference]: Start difference. First operand 129 states and 215 transitions. Second operand 3 states. [2018-10-27 00:43:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:17,278 INFO L93 Difference]: Finished difference Result 237 states and 401 transitions. [2018-10-27 00:43:17,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:17,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-27 00:43:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:17,280 INFO L225 Difference]: With dead ends: 237 [2018-10-27 00:43:17,280 INFO L226 Difference]: Without dead ends: 235 [2018-10-27 00:43:17,280 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-10-27 00:43:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-27 00:43:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 173. [2018-10-27 00:43:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-27 00:43:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 287 transitions. [2018-10-27 00:43:17,293 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 287 transitions. Word has length 22 [2018-10-27 00:43:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:17,294 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 287 transitions. [2018-10-27 00:43:17,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 287 transitions. [2018-10-27 00:43:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 00:43:17,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:17,297 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-10-27 00:43:17,299 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:17,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 418187080, now seen corresponding path program 1 times [2018-10-27 00:43:17,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:17,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:17,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:17,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:17,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:17,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:17,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:17,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:17,394 INFO L87 Difference]: Start difference. First operand 173 states and 287 transitions. Second operand 3 states. [2018-10-27 00:43:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:17,465 INFO L93 Difference]: Finished difference Result 405 states and 677 transitions. [2018-10-27 00:43:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:17,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-27 00:43:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:17,467 INFO L225 Difference]: With dead ends: 405 [2018-10-27 00:43:17,467 INFO L226 Difference]: Without dead ends: 243 [2018-10-27 00:43:17,468 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-10-27 00:43:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-27 00:43:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-10-27 00:43:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-27 00:43:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 395 transitions. [2018-10-27 00:43:17,478 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 395 transitions. Word has length 22 [2018-10-27 00:43:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:17,478 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 395 transitions. [2018-10-27 00:43:17,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 395 transitions. [2018-10-27 00:43:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 00:43:17,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:17,480 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-10-27 00:43:17,480 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:17,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash 665917993, now seen corresponding path program 1 times [2018-10-27 00:43:17,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:17,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:17,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:17,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:17,565 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:17,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:17,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:17,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:17,566 INFO L87 Difference]: Start difference. First operand 241 states and 395 transitions. Second operand 3 states. [2018-10-27 00:43:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:17,627 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2018-10-27 00:43:17,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:17,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-27 00:43:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:17,628 INFO L225 Difference]: With dead ends: 361 [2018-10-27 00:43:17,628 INFO L226 Difference]: Without dead ends: 247 [2018-10-27 00:43:17,629 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-10-27 00:43:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-27 00:43:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-10-27 00:43:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-27 00:43:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 395 transitions. [2018-10-27 00:43:17,637 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 395 transitions. Word has length 23 [2018-10-27 00:43:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:17,637 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 395 transitions. [2018-10-27 00:43:17,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 395 transitions. [2018-10-27 00:43:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 00:43:17,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:17,638 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-10-27 00:43:17,638 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:17,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash 79111979, now seen corresponding path program 1 times [2018-10-27 00:43:17,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:17,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:17,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,640 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:17,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:17,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:17,709 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:17,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:17,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:17,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:17,709 INFO L87 Difference]: Start difference. First operand 245 states and 395 transitions. Second operand 3 states. [2018-10-27 00:43:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:17,792 INFO L93 Difference]: Finished difference Result 445 states and 729 transitions. [2018-10-27 00:43:17,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:17,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-27 00:43:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:17,794 INFO L225 Difference]: With dead ends: 445 [2018-10-27 00:43:17,794 INFO L226 Difference]: Without dead ends: 443 [2018-10-27 00:43:17,794 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-10-27 00:43:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-27 00:43:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 337. [2018-10-27 00:43:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-27 00:43:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 535 transitions. [2018-10-27 00:43:17,805 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 535 transitions. Word has length 23 [2018-10-27 00:43:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:17,805 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 535 transitions. [2018-10-27 00:43:17,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 535 transitions. [2018-10-27 00:43:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 00:43:17,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:17,806 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-10-27 00:43:17,806 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:17,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash 337277417, now seen corresponding path program 1 times [2018-10-27 00:43:17,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,812 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:17,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:17,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:17,857 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:17,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:17,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:17,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:17,857 INFO L87 Difference]: Start difference. First operand 337 states and 535 transitions. Second operand 3 states. [2018-10-27 00:43:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:17,897 INFO L93 Difference]: Finished difference Result 789 states and 1257 transitions. [2018-10-27 00:43:17,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:17,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-27 00:43:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:17,900 INFO L225 Difference]: With dead ends: 789 [2018-10-27 00:43:17,900 INFO L226 Difference]: Without dead ends: 467 [2018-10-27 00:43:17,900 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-10-27 00:43:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-27 00:43:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2018-10-27 00:43:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-10-27 00:43:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 727 transitions. [2018-10-27 00:43:17,917 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 727 transitions. Word has length 23 [2018-10-27 00:43:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:17,918 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 727 transitions. [2018-10-27 00:43:17,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 727 transitions. [2018-10-27 00:43:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 00:43:17,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:17,920 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-10-27 00:43:17,921 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:17,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:17,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1842281219, now seen corresponding path program 1 times [2018-10-27 00:43:17,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:17,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:17,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:17,922 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:17,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:17,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:17,965 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:17,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:17,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:17,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:17,965 INFO L87 Difference]: Start difference. First operand 465 states and 727 transitions. Second operand 3 states. [2018-10-27 00:43:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:18,016 INFO L93 Difference]: Finished difference Result 697 states and 1085 transitions. [2018-10-27 00:43:18,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:18,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-27 00:43:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:18,019 INFO L225 Difference]: With dead ends: 697 [2018-10-27 00:43:18,019 INFO L226 Difference]: Without dead ends: 475 [2018-10-27 00:43:18,019 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-10-27 00:43:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-10-27 00:43:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 473. [2018-10-27 00:43:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-27 00:43:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 727 transitions. [2018-10-27 00:43:18,036 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 727 transitions. Word has length 24 [2018-10-27 00:43:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:18,036 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 727 transitions. [2018-10-27 00:43:18,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 727 transitions. [2018-10-27 00:43:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 00:43:18,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:18,038 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-10-27 00:43:18,038 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:18,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1865880063, now seen corresponding path program 1 times [2018-10-27 00:43:18,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:18,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:18,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:18,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:18,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:18,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:18,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:18,106 INFO L87 Difference]: Start difference. First operand 473 states and 727 transitions. Second operand 3 states. [2018-10-27 00:43:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:18,231 INFO L93 Difference]: Finished difference Result 1357 states and 2073 transitions. [2018-10-27 00:43:18,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:18,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-27 00:43:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:18,234 INFO L225 Difference]: With dead ends: 1357 [2018-10-27 00:43:18,234 INFO L226 Difference]: Without dead ends: 907 [2018-10-27 00:43:18,236 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-10-27 00:43:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-10-27 00:43:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 905. [2018-10-27 00:43:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-10-27 00:43:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1351 transitions. [2018-10-27 00:43:18,263 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1351 transitions. Word has length 24 [2018-10-27 00:43:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:18,264 INFO L481 AbstractCegarLoop]: Abstraction has 905 states and 1351 transitions. [2018-10-27 00:43:18,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1351 transitions. [2018-10-27 00:43:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 00:43:18,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:18,265 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-10-27 00:43:18,266 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:18,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:18,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1607714625, now seen corresponding path program 1 times [2018-10-27 00:43:18,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:18,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:18,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,267 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:18,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:18,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:18,333 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:18,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:18,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:18,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:18,333 INFO L87 Difference]: Start difference. First operand 905 states and 1351 transitions. Second operand 3 states. [2018-10-27 00:43:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:18,418 INFO L93 Difference]: Finished difference Result 1085 states and 1657 transitions. [2018-10-27 00:43:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:18,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-27 00:43:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:18,422 INFO L225 Difference]: With dead ends: 1085 [2018-10-27 00:43:18,423 INFO L226 Difference]: Without dead ends: 1083 [2018-10-27 00:43:18,423 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-10-27 00:43:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-10-27 00:43:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 905. [2018-10-27 00:43:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-10-27 00:43:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1335 transitions. [2018-10-27 00:43:18,455 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1335 transitions. Word has length 24 [2018-10-27 00:43:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:18,455 INFO L481 AbstractCegarLoop]: Abstraction has 905 states and 1335 transitions. [2018-10-27 00:43:18,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1335 transitions. [2018-10-27 00:43:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 00:43:18,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:18,458 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-10-27 00:43:18,459 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:18,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2007922174, now seen corresponding path program 1 times [2018-10-27 00:43:18,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:18,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:18,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:18,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:18,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:18,525 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:18,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:18,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:18,526 INFO L87 Difference]: Start difference. First operand 905 states and 1335 transitions. Second operand 3 states. [2018-10-27 00:43:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:18,631 INFO L93 Difference]: Finished difference Result 1597 states and 2393 transitions. [2018-10-27 00:43:18,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:18,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-27 00:43:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:18,637 INFO L225 Difference]: With dead ends: 1597 [2018-10-27 00:43:18,637 INFO L226 Difference]: Without dead ends: 1595 [2018-10-27 00:43:18,639 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-10-27 00:43:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-10-27 00:43:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1305. [2018-10-27 00:43:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-10-27 00:43:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1879 transitions. [2018-10-27 00:43:18,683 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1879 transitions. Word has length 25 [2018-10-27 00:43:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:18,684 INFO L481 AbstractCegarLoop]: Abstraction has 1305 states and 1879 transitions. [2018-10-27 00:43:18,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1879 transitions. [2018-10-27 00:43:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 00:43:18,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:18,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-10-27 00:43:18,686 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:18,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2028879684, now seen corresponding path program 1 times [2018-10-27 00:43:18,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:18,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,691 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:18,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:18,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:18,755 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:18,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:18,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:18,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:18,755 INFO L87 Difference]: Start difference. First operand 1305 states and 1879 transitions. Second operand 3 states. [2018-10-27 00:43:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:18,884 INFO L93 Difference]: Finished difference Result 3037 states and 4377 transitions. [2018-10-27 00:43:18,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:18,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-27 00:43:18,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:18,889 INFO L225 Difference]: With dead ends: 3037 [2018-10-27 00:43:18,889 INFO L226 Difference]: Without dead ends: 1755 [2018-10-27 00:43:18,891 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-10-27 00:43:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2018-10-27 00:43:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2018-10-27 00:43:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-10-27 00:43:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2471 transitions. [2018-10-27 00:43:18,950 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2471 transitions. Word has length 25 [2018-10-27 00:43:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:18,950 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2471 transitions. [2018-10-27 00:43:18,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2471 transitions. [2018-10-27 00:43:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 00:43:18,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:18,953 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-10-27 00:43:18,953 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:18,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:18,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2116260660, now seen corresponding path program 1 times [2018-10-27 00:43:18,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:18,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:18,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:18,954 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:19,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:19,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:19,025 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:19,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:19,026 INFO L87 Difference]: Start difference. First operand 1753 states and 2471 transitions. Second operand 3 states. [2018-10-27 00:43:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:19,145 INFO L93 Difference]: Finished difference Result 2653 states and 3737 transitions. [2018-10-27 00:43:19,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:19,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-27 00:43:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:19,150 INFO L225 Difference]: With dead ends: 2653 [2018-10-27 00:43:19,150 INFO L226 Difference]: Without dead ends: 1803 [2018-10-27 00:43:19,152 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-10-27 00:43:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-10-27 00:43:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2018-10-27 00:43:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1801 states. [2018-10-27 00:43:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2503 transitions. [2018-10-27 00:43:19,200 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2503 transitions. Word has length 26 [2018-10-27 00:43:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:19,201 INFO L481 AbstractCegarLoop]: Abstraction has 1801 states and 2503 transitions. [2018-10-27 00:43:19,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2503 transitions. [2018-10-27 00:43:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 00:43:19,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:19,202 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-10-27 00:43:19,203 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:19,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1529454646, now seen corresponding path program 1 times [2018-10-27 00:43:19,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:19,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:19,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:19,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:19,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:19,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:19,269 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:19,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:19,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:19,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:19,269 INFO L87 Difference]: Start difference. First operand 1801 states and 2503 transitions. Second operand 3 states. [2018-10-27 00:43:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:19,401 INFO L93 Difference]: Finished difference Result 3085 states and 4329 transitions. [2018-10-27 00:43:19,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:19,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-27 00:43:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:19,410 INFO L225 Difference]: With dead ends: 3085 [2018-10-27 00:43:19,411 INFO L226 Difference]: Without dead ends: 3083 [2018-10-27 00:43:19,412 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-10-27 00:43:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-10-27 00:43:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2633. [2018-10-27 00:43:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2018-10-27 00:43:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3559 transitions. [2018-10-27 00:43:19,479 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3559 transitions. Word has length 26 [2018-10-27 00:43:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:19,480 INFO L481 AbstractCegarLoop]: Abstraction has 2633 states and 3559 transitions. [2018-10-27 00:43:19,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3559 transitions. [2018-10-27 00:43:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 00:43:19,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:19,482 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-10-27 00:43:19,484 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:19,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1787620084, now seen corresponding path program 1 times [2018-10-27 00:43:19,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:19,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:19,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:19,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:19,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:19,547 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:19,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:19,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:19,548 INFO L87 Difference]: Start difference. First operand 2633 states and 3559 transitions. Second operand 3 states. [2018-10-27 00:43:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:19,720 INFO L93 Difference]: Finished difference Result 6029 states and 8105 transitions. [2018-10-27 00:43:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:19,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-27 00:43:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:19,730 INFO L225 Difference]: With dead ends: 6029 [2018-10-27 00:43:19,730 INFO L226 Difference]: Without dead ends: 3467 [2018-10-27 00:43:19,734 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-10-27 00:43:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-10-27 00:43:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3465. [2018-10-27 00:43:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3465 states. [2018-10-27 00:43:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4551 transitions. [2018-10-27 00:43:19,824 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4551 transitions. Word has length 26 [2018-10-27 00:43:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:19,824 INFO L481 AbstractCegarLoop]: Abstraction has 3465 states and 4551 transitions. [2018-10-27 00:43:19,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4551 transitions. [2018-10-27 00:43:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 00:43:19,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:19,829 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-10-27 00:43:19,829 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:19,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash 168669521, now seen corresponding path program 1 times [2018-10-27 00:43:19,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:19,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:19,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:19,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:19,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:19,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:19,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:19,892 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:19,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:19,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:19,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:19,893 INFO L87 Difference]: Start difference. First operand 3465 states and 4551 transitions. Second operand 3 states. [2018-10-27 00:43:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:20,018 INFO L93 Difference]: Finished difference Result 5197 states and 6793 transitions. [2018-10-27 00:43:20,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:20,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-27 00:43:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:20,028 INFO L225 Difference]: With dead ends: 5197 [2018-10-27 00:43:20,029 INFO L226 Difference]: Without dead ends: 3531 [2018-10-27 00:43:20,032 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-10-27 00:43:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2018-10-27 00:43:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3529. [2018-10-27 00:43:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-10-27 00:43:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4551 transitions. [2018-10-27 00:43:20,120 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4551 transitions. Word has length 27 [2018-10-27 00:43:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:20,120 INFO L481 AbstractCegarLoop]: Abstraction has 3529 states and 4551 transitions. [2018-10-27 00:43:20,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4551 transitions. [2018-10-27 00:43:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 00:43:20,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:20,125 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-10-27 00:43:20,125 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:20,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash -418136493, now seen corresponding path program 1 times [2018-10-27 00:43:20,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:20,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:20,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:20,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:20,127 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:20,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:20,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:20,205 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:20,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:20,205 INFO L87 Difference]: Start difference. First operand 3529 states and 4551 transitions. Second operand 3 states. [2018-10-27 00:43:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:20,367 INFO L93 Difference]: Finished difference Result 5901 states and 7625 transitions. [2018-10-27 00:43:20,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:20,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-27 00:43:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:20,386 INFO L225 Difference]: With dead ends: 5901 [2018-10-27 00:43:20,387 INFO L226 Difference]: Without dead ends: 5899 [2018-10-27 00:43:20,389 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-10-27 00:43:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2018-10-27 00:43:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 5257. [2018-10-27 00:43:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5257 states. [2018-10-27 00:43:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 6599 transitions. [2018-10-27 00:43:20,531 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 6599 transitions. Word has length 27 [2018-10-27 00:43:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:20,531 INFO L481 AbstractCegarLoop]: Abstraction has 5257 states and 6599 transitions. [2018-10-27 00:43:20,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 6599 transitions. [2018-10-27 00:43:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 00:43:20,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:20,538 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-10-27 00:43:20,539 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:20,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash -159971055, now seen corresponding path program 1 times [2018-10-27 00:43:20,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:20,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:20,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:20,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:20,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:20,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:20,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:20,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:20,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:20,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:20,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:20,605 INFO L87 Difference]: Start difference. First operand 5257 states and 6599 transitions. Second operand 3 states. [2018-10-27 00:43:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:20,803 INFO L93 Difference]: Finished difference Result 11917 states and 14793 transitions. [2018-10-27 00:43:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:20,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-27 00:43:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:20,830 INFO L225 Difference]: With dead ends: 11917 [2018-10-27 00:43:20,831 INFO L226 Difference]: Without dead ends: 6795 [2018-10-27 00:43:20,838 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-10-27 00:43:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6795 states. [2018-10-27 00:43:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6795 to 6793. [2018-10-27 00:43:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-10-27 00:43:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 8199 transitions. [2018-10-27 00:43:21,009 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 8199 transitions. Word has length 27 [2018-10-27 00:43:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:21,010 INFO L481 AbstractCegarLoop]: Abstraction has 6793 states and 8199 transitions. [2018-10-27 00:43:21,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 8199 transitions. [2018-10-27 00:43:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 00:43:21,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:21,017 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-10-27 00:43:21,017 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:21,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash -77113303, now seen corresponding path program 1 times [2018-10-27 00:43:21,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:21,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:21,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:21,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:21,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:21,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:21,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:21,085 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:21,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:21,085 INFO L87 Difference]: Start difference. First operand 6793 states and 8199 transitions. Second operand 3 states. [2018-10-27 00:43:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:21,256 INFO L93 Difference]: Finished difference Result 10189 states and 12233 transitions. [2018-10-27 00:43:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:21,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-27 00:43:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:21,269 INFO L225 Difference]: With dead ends: 10189 [2018-10-27 00:43:21,269 INFO L226 Difference]: Without dead ends: 6923 [2018-10-27 00:43:21,275 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-10-27 00:43:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2018-10-27 00:43:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 6921. [2018-10-27 00:43:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6921 states. [2018-10-27 00:43:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 8199 transitions. [2018-10-27 00:43:21,451 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 8199 transitions. Word has length 28 [2018-10-27 00:43:21,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:21,451 INFO L481 AbstractCegarLoop]: Abstraction has 6921 states and 8199 transitions. [2018-10-27 00:43:21,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 8199 transitions. [2018-10-27 00:43:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 00:43:21,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:21,493 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-10-27 00:43:21,493 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:21,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:21,493 INFO L82 PathProgramCache]: Analyzing trace with hash -663919317, now seen corresponding path program 1 times [2018-10-27 00:43:21,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:21,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:21,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:21,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:21,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:21,556 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:21,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:21,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:21,557 INFO L87 Difference]: Start difference. First operand 6921 states and 8199 transitions. Second operand 3 states. [2018-10-27 00:43:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:21,784 INFO L93 Difference]: Finished difference Result 11275 states and 13192 transitions. [2018-10-27 00:43:21,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:21,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-27 00:43:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:21,801 INFO L225 Difference]: With dead ends: 11275 [2018-10-27 00:43:21,801 INFO L226 Difference]: Without dead ends: 11273 [2018-10-27 00:43:21,805 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-10-27 00:43:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2018-10-27 00:43:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 10505. [2018-10-27 00:43:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10505 states. [2018-10-27 00:43:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 12167 transitions. [2018-10-27 00:43:22,003 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 12167 transitions. Word has length 28 [2018-10-27 00:43:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:22,004 INFO L481 AbstractCegarLoop]: Abstraction has 10505 states and 12167 transitions. [2018-10-27 00:43:22,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 12167 transitions. [2018-10-27 00:43:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 00:43:22,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:22,016 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-10-27 00:43:22,016 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:22,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:22,017 INFO L82 PathProgramCache]: Analyzing trace with hash -405753879, now seen corresponding path program 1 times [2018-10-27 00:43:22,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:22,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:22,018 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:43:22,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:43:22,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:43:22,089 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:22,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:43:22,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:43:22,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:43:22,090 INFO L87 Difference]: Start difference. First operand 10505 states and 12167 transitions. Second operand 3 states. [2018-10-27 00:43:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:22,380 INFO L93 Difference]: Finished difference Result 23561 states and 26759 transitions. [2018-10-27 00:43:22,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:43:22,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-27 00:43:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:22,381 INFO L225 Difference]: With dead ends: 23561 [2018-10-27 00:43:22,381 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 00:43:22,404 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-10-27 00:43:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 00:43:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 00:43:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 00:43:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 00:43:22,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-10-27 00:43:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:22,405 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 00:43:22,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:43:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 00:43:22,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 00:43:22,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 00:43:22,525 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 00:43:22,525 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:43:22,525 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:43:22,526 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 00:43:22,526 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 00:43:22,526 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 00:43:22,526 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,526 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-10-27 00:43:22,526 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-10-27 00:43:22,526 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,526 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-10-27 00:43:22,526 INFO L425 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,526 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-10-27 00:43:22,526 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L428 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-27 00:43:22,527 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L428 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L421 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,528 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-10-27 00:43:22,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:43:22 BoogieIcfgContainer [2018-10-27 00:43:22,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:43:22,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:43:22,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:43:22,546 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:43:22,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:43:16" (3/4) ... [2018-10-27 00:43:22,555 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 00:43:22,566 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 00:43:22,566 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 00:43:22,571 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-27 00:43:22,572 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 00:43:22,572 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 00:43:22,638 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e40455c4-37ff-4f56-87f4-c839cc48b057/bin-2019/utaipan/witness.graphml [2018-10-27 00:43:22,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:43:22,639 INFO L168 Benchmark]: Toolchain (without parser) took 7260.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 960.7 MB in the beginning and 866.0 MB in the end (delta: 94.7 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:43:22,644 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:43:22,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.29 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:43:22,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.69 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:43:22,644 INFO L168 Benchmark]: Boogie Preprocessor took 20.69 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:43:22,645 INFO L168 Benchmark]: RCFGBuilder took 638.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-10-27 00:43:22,645 INFO L168 Benchmark]: TraceAbstraction took 6307.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 869.0 MB in the end (delta: 255.8 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. [2018-10-27 00:43:22,645 INFO L168 Benchmark]: Witness Printer took 92.06 ms. Allocated memory is still 1.2 GB. Free memory was 869.0 MB in the beginning and 866.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2018-10-27 00:43:22,647 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.29 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.69 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.69 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 638.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6307.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 869.0 MB in the end (delta: 255.8 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. * Witness Printer took 92.06 ms. Allocated memory is still 1.2 GB. Free memory was 869.0 MB in the beginning and 866.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 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, 6.2s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1990 SDtfs, 948 SDslu, 1336 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s 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.2s 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.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.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...