./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/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_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/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-5842f4b [2018-11-18 10:58:51,265 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:58:51,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:58:51,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:58:51,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:58:51,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:58:51,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:58:51,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:58:51,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:58:51,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:58:51,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:58:51,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:58:51,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:58:51,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:58:51,281 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:58:51,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:58:51,282 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:58:51,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:58:51,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:58:51,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:58:51,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:58:51,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:58:51,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:58:51,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:58:51,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:58:51,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:58:51,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:58:51,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:58:51,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:58:51,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:58:51,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:58:51,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:58:51,293 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:58:51,293 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:58:51,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:58:51,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:58:51,295 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 10:58:51,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:58:51,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:58:51,303 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:58:51,304 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:58:51,304 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:58:51,304 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:58:51,304 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:58:51,304 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 10:58:51,304 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:58:51,304 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:58:51,305 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 10:58:51,305 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 10:58:51,305 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:58:51,305 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:58:51,305 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:58:51,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:58:51,306 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:58:51,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:58:51,306 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:58:51,306 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:58:51,306 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:58:51,306 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:58:51,307 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:58:51,307 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:58:51,307 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:58:51,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:58:51,307 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:58:51,307 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:58:51,307 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:58:51,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:58:51,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:58:51,308 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:58:51,308 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:58:51,308 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 10:58:51,308 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:58:51,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:58:51,308 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 10:58:51,308 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_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-11-18 10:58:51,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:58:51,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:58:51,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:58:51,345 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:58:51,345 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:58:51,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:58:51,384 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/data/fe6d0701d/cb30521916e54540b728fd901eacc64f/FLAG263ef9c92 [2018-11-18 10:58:51,773 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:58:51,773 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:58:51,777 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/data/fe6d0701d/cb30521916e54540b728fd901eacc64f/FLAG263ef9c92 [2018-11-18 10:58:51,786 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/data/fe6d0701d/cb30521916e54540b728fd901eacc64f [2018-11-18 10:58:51,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:58:51,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:58:51,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:58:51,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:58:51,792 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:58:51,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8be4c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51, skipping insertion in model container [2018-11-18 10:58:51,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:58:51,814 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:58:51,928 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:58:51,930 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:58:51,945 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:58:51,953 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:58:51,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51 WrapperNode [2018-11-18 10:58:51,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:58:51,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:58:51,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:58:51,953 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:58:51,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:58:51,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:58:51,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:58:51,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:58:51,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... [2018-11-18 10:58:51,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:58:51,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:58:51,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:58:51,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:58:51,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:58:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:58:52,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:58:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:58:52,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:58:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:58:52,072 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:58:52,255 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:58:52,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:58:52 BoogieIcfgContainer [2018-11-18 10:58:52,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:58:52,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:58:52,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:58:52,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:58:52,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:58:51" (1/3) ... [2018-11-18 10:58:52,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49327fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:58:52, skipping insertion in model container [2018-11-18 10:58:52,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:58:51" (2/3) ... [2018-11-18 10:58:52,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49327fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:58:52, skipping insertion in model container [2018-11-18 10:58:52,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:58:52" (3/3) ... [2018-11-18 10:58:52,261 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:58:52,270 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:58:52,276 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:58:52,288 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:58:52,315 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:58:52,315 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:58:52,315 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:58:52,315 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:58:52,315 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:58:52,315 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:58:52,315 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:58:52,315 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:58:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-18 10:58:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:58:52,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:52,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:52,341 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:52,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash -811584747, now seen corresponding path program 1 times [2018-11-18 10:58:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:52,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:52,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:52,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:52,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:52,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,487 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-18 10:58:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:52,523 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2018-11-18 10:58:52,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:52,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 10:58:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:52,531 INFO L225 Difference]: With dead ends: 83 [2018-11-18 10:58:52,531 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 10:58:52,532 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 10:58:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-11-18 10:58:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 10:58:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2018-11-18 10:58:52,556 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2018-11-18 10:58:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:52,557 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2018-11-18 10:58:52,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2018-11-18 10:58:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:58:52,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:52,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:52,558 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:52,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:52,558 INFO L82 PathProgramCache]: Analyzing trace with hash -553419309, now seen corresponding path program 1 times [2018-11-18 10:58:52,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:52,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:52,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:52,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:52,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:52,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:52,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:52,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,593 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand 3 states. [2018-11-18 10:58:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:52,620 INFO L93 Difference]: Finished difference Result 110 states and 195 transitions. [2018-11-18 10:58:52,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:52,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 10:58:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:52,621 INFO L225 Difference]: With dead ends: 110 [2018-11-18 10:58:52,622 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 10:58:52,622 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 10:58:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-18 10:58:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 10:58:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 115 transitions. [2018-11-18 10:58:52,628 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 115 transitions. Word has length 20 [2018-11-18 10:58:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:52,628 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 115 transitions. [2018-11-18 10:58:52,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 115 transitions. [2018-11-18 10:58:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 10:58:52,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:52,629 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:52,629 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:52,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash 610890324, now seen corresponding path program 1 times [2018-11-18 10:58:52,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:52,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:52,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:52,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:52,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:52,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,659 INFO L87 Difference]: Start difference. First operand 66 states and 115 transitions. Second operand 3 states. [2018-11-18 10:58:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:52,676 INFO L93 Difference]: Finished difference Result 103 states and 175 transitions. [2018-11-18 10:58:52,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:52,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 10:58:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:52,677 INFO L225 Difference]: With dead ends: 103 [2018-11-18 10:58:52,677 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 10:58:52,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 10:58:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-18 10:58:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 10:58:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2018-11-18 10:58:52,682 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 21 [2018-11-18 10:58:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:52,682 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 118 transitions. [2018-11-18 10:58:52,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-11-18 10:58:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 10:58:52,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:52,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:52,683 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:52,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash 24084310, now seen corresponding path program 1 times [2018-11-18 10:58:52,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:52,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:52,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:52,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:52,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:52,721 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:52,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:52,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:52,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,721 INFO L87 Difference]: Start difference. First operand 70 states and 118 transitions. Second operand 3 states. [2018-11-18 10:58:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:52,736 INFO L93 Difference]: Finished difference Result 129 states and 221 transitions. [2018-11-18 10:58:52,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:52,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 10:58:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:52,737 INFO L225 Difference]: With dead ends: 129 [2018-11-18 10:58:52,738 INFO L226 Difference]: Without dead ends: 127 [2018-11-18 10:58:52,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-18 10:58:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-11-18 10:58:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 10:58:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 155 transitions. [2018-11-18 10:58:52,746 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 155 transitions. Word has length 21 [2018-11-18 10:58:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:52,746 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 155 transitions. [2018-11-18 10:58:52,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 155 transitions. [2018-11-18 10:58:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 10:58:52,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:52,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:52,747 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:52,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:52,748 INFO L82 PathProgramCache]: Analyzing trace with hash 282249748, now seen corresponding path program 1 times [2018-11-18 10:58:52,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:52,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:52,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:52,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:52,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:52,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:52,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,775 INFO L87 Difference]: Start difference. First operand 91 states and 155 transitions. Second operand 3 states. [2018-11-18 10:58:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:52,805 INFO L93 Difference]: Finished difference Result 211 states and 365 transitions. [2018-11-18 10:58:52,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:52,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 10:58:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:52,806 INFO L225 Difference]: With dead ends: 211 [2018-11-18 10:58:52,806 INFO L226 Difference]: Without dead ends: 129 [2018-11-18 10:58:52,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-18 10:58:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-11-18 10:58:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-18 10:58:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 215 transitions. [2018-11-18 10:58:52,814 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 215 transitions. Word has length 21 [2018-11-18 10:58:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:52,814 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 215 transitions. [2018-11-18 10:58:52,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 215 transitions. [2018-11-18 10:58:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 10:58:52,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:52,815 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:52,815 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:52,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:52,815 INFO L82 PathProgramCache]: Analyzing trace with hash 746827656, now seen corresponding path program 1 times [2018-11-18 10:58:52,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:52,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:52,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:52,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:52,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:52,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:52,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:52,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:52,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,839 INFO L87 Difference]: Start difference. First operand 127 states and 215 transitions. Second operand 3 states. [2018-11-18 10:58:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:52,859 INFO L93 Difference]: Finished difference Result 190 states and 320 transitions. [2018-11-18 10:58:52,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:52,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 10:58:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:52,860 INFO L225 Difference]: With dead ends: 190 [2018-11-18 10:58:52,860 INFO L226 Difference]: Without dead ends: 131 [2018-11-18 10:58:52,861 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-18 10:58:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-11-18 10:58:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-18 10:58:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 215 transitions. [2018-11-18 10:58:52,869 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 215 transitions. Word has length 22 [2018-11-18 10:58:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:52,869 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 215 transitions. [2018-11-18 10:58:52,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 215 transitions. [2018-11-18 10:58:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 10:58:52,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:52,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:52,870 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:52,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:52,871 INFO L82 PathProgramCache]: Analyzing trace with hash 160021642, now seen corresponding path program 1 times [2018-11-18 10:58:52,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:52,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:52,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:52,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:52,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:52,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:52,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:52,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:52,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,903 INFO L87 Difference]: Start difference. First operand 129 states and 215 transitions. Second operand 3 states. [2018-11-18 10:58:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:52,919 INFO L93 Difference]: Finished difference Result 237 states and 401 transitions. [2018-11-18 10:58:52,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:52,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 10:58:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:52,921 INFO L225 Difference]: With dead ends: 237 [2018-11-18 10:58:52,922 INFO L226 Difference]: Without dead ends: 235 [2018-11-18 10:58:52,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-18 10:58:52,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 173. [2018-11-18 10:58:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 10:58:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 287 transitions. [2018-11-18 10:58:52,932 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 287 transitions. Word has length 22 [2018-11-18 10:58:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:52,932 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 287 transitions. [2018-11-18 10:58:52,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 287 transitions. [2018-11-18 10:58:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 10:58:52,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:52,933 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:52,934 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:52,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash 418187080, now seen corresponding path program 1 times [2018-11-18 10:58:52,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:52,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:52,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:52,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:52,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:52,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:52,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:52,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:52,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,962 INFO L87 Difference]: Start difference. First operand 173 states and 287 transitions. Second operand 3 states. [2018-11-18 10:58:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:52,985 INFO L93 Difference]: Finished difference Result 405 states and 677 transitions. [2018-11-18 10:58:52,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:52,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 10:58:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:52,986 INFO L225 Difference]: With dead ends: 405 [2018-11-18 10:58:52,986 INFO L226 Difference]: Without dead ends: 243 [2018-11-18 10:58:52,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-18 10:58:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-11-18 10:58:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-18 10:58:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 395 transitions. [2018-11-18 10:58:52,995 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 395 transitions. Word has length 22 [2018-11-18 10:58:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:52,996 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 395 transitions. [2018-11-18 10:58:52,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 395 transitions. [2018-11-18 10:58:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:58:52,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:52,997 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:52,997 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:52,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash 665917993, now seen corresponding path program 1 times [2018-11-18 10:58:52,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:52,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:53,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,027 INFO L87 Difference]: Start difference. First operand 241 states and 395 transitions. Second operand 3 states. [2018-11-18 10:58:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,044 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2018-11-18 10:58:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:58:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,045 INFO L225 Difference]: With dead ends: 361 [2018-11-18 10:58:53,045 INFO L226 Difference]: Without dead ends: 247 [2018-11-18 10:58:53,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-18 10:58:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-11-18 10:58:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-18 10:58:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 395 transitions. [2018-11-18 10:58:53,052 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 395 transitions. Word has length 23 [2018-11-18 10:58:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:53,053 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 395 transitions. [2018-11-18 10:58:53,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 395 transitions. [2018-11-18 10:58:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:58:53,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:53,054 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:53,054 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:53,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash 79111979, now seen corresponding path program 1 times [2018-11-18 10:58:53,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:53,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:53,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,078 INFO L87 Difference]: Start difference. First operand 245 states and 395 transitions. Second operand 3 states. [2018-11-18 10:58:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,100 INFO L93 Difference]: Finished difference Result 445 states and 729 transitions. [2018-11-18 10:58:53,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:58:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,103 INFO L225 Difference]: With dead ends: 445 [2018-11-18 10:58:53,103 INFO L226 Difference]: Without dead ends: 443 [2018-11-18 10:58:53,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-18 10:58:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 337. [2018-11-18 10:58:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-18 10:58:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 535 transitions. [2018-11-18 10:58:53,114 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 535 transitions. Word has length 23 [2018-11-18 10:58:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:53,114 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 535 transitions. [2018-11-18 10:58:53,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 535 transitions. [2018-11-18 10:58:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:58:53,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:53,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:53,115 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:53,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:53,115 INFO L82 PathProgramCache]: Analyzing trace with hash 337277417, now seen corresponding path program 1 times [2018-11-18 10:58:53,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:53,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,130 INFO L87 Difference]: Start difference. First operand 337 states and 535 transitions. Second operand 3 states. [2018-11-18 10:58:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,149 INFO L93 Difference]: Finished difference Result 789 states and 1257 transitions. [2018-11-18 10:58:53,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:58:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,152 INFO L225 Difference]: With dead ends: 789 [2018-11-18 10:58:53,152 INFO L226 Difference]: Without dead ends: 467 [2018-11-18 10:58:53,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-11-18 10:58:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2018-11-18 10:58:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-18 10:58:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 727 transitions. [2018-11-18 10:58:53,166 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 727 transitions. Word has length 23 [2018-11-18 10:58:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:53,166 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 727 transitions. [2018-11-18 10:58:53,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 727 transitions. [2018-11-18 10:58:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:58:53,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:53,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:53,169 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:53,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1842281219, now seen corresponding path program 1 times [2018-11-18 10:58:53,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:53,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:53,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,202 INFO L87 Difference]: Start difference. First operand 465 states and 727 transitions. Second operand 3 states. [2018-11-18 10:58:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,231 INFO L93 Difference]: Finished difference Result 697 states and 1085 transitions. [2018-11-18 10:58:53,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 10:58:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,233 INFO L225 Difference]: With dead ends: 697 [2018-11-18 10:58:53,233 INFO L226 Difference]: Without dead ends: 475 [2018-11-18 10:58:53,234 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-11-18 10:58:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 473. [2018-11-18 10:58:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-11-18 10:58:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 727 transitions. [2018-11-18 10:58:53,249 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 727 transitions. Word has length 24 [2018-11-18 10:58:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:53,249 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 727 transitions. [2018-11-18 10:58:53,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 727 transitions. [2018-11-18 10:58:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:58:53,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:53,250 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:53,250 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:53,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1865880063, now seen corresponding path program 1 times [2018-11-18 10:58:53,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:53,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,267 INFO L87 Difference]: Start difference. First operand 473 states and 727 transitions. Second operand 3 states. [2018-11-18 10:58:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,294 INFO L93 Difference]: Finished difference Result 1357 states and 2073 transitions. [2018-11-18 10:58:53,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 10:58:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,297 INFO L225 Difference]: With dead ends: 1357 [2018-11-18 10:58:53,298 INFO L226 Difference]: Without dead ends: 907 [2018-11-18 10:58:53,299 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-18 10:58:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 905. [2018-11-18 10:58:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-11-18 10:58:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1351 transitions. [2018-11-18 10:58:53,326 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1351 transitions. Word has length 24 [2018-11-18 10:58:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:53,326 INFO L480 AbstractCegarLoop]: Abstraction has 905 states and 1351 transitions. [2018-11-18 10:58:53,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1351 transitions. [2018-11-18 10:58:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:58:53,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:53,328 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:53,328 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:53,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:53,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1607714625, now seen corresponding path program 1 times [2018-11-18 10:58:53,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:53,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:53,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:53,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,347 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,347 INFO L87 Difference]: Start difference. First operand 905 states and 1351 transitions. Second operand 3 states. [2018-11-18 10:58:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,372 INFO L93 Difference]: Finished difference Result 1085 states and 1657 transitions. [2018-11-18 10:58:53,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 10:58:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,376 INFO L225 Difference]: With dead ends: 1085 [2018-11-18 10:58:53,376 INFO L226 Difference]: Without dead ends: 1083 [2018-11-18 10:58:53,377 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-11-18 10:58:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 905. [2018-11-18 10:58:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-11-18 10:58:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1335 transitions. [2018-11-18 10:58:53,405 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1335 transitions. Word has length 24 [2018-11-18 10:58:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:53,405 INFO L480 AbstractCegarLoop]: Abstraction has 905 states and 1335 transitions. [2018-11-18 10:58:53,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1335 transitions. [2018-11-18 10:58:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:58:53,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:53,406 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:53,406 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:53,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:53,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2007922174, now seen corresponding path program 1 times [2018-11-18 10:58:53,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:53,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:53,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:53,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,421 INFO L87 Difference]: Start difference. First operand 905 states and 1335 transitions. Second operand 3 states. [2018-11-18 10:58:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,455 INFO L93 Difference]: Finished difference Result 1597 states and 2393 transitions. [2018-11-18 10:58:53,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:58:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,460 INFO L225 Difference]: With dead ends: 1597 [2018-11-18 10:58:53,460 INFO L226 Difference]: Without dead ends: 1595 [2018-11-18 10:58:53,460 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-18 10:58:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1305. [2018-11-18 10:58:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-11-18 10:58:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1879 transitions. [2018-11-18 10:58:53,499 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1879 transitions. Word has length 25 [2018-11-18 10:58:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:53,499 INFO L480 AbstractCegarLoop]: Abstraction has 1305 states and 1879 transitions. [2018-11-18 10:58:53,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1879 transitions. [2018-11-18 10:58:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:58:53,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:53,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:53,501 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:53,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2028879684, now seen corresponding path program 1 times [2018-11-18 10:58:53,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:53,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:53,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,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-11-18 10:58:53,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,526 INFO L87 Difference]: Start difference. First operand 1305 states and 1879 transitions. Second operand 3 states. [2018-11-18 10:58:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,601 INFO L93 Difference]: Finished difference Result 3037 states and 4377 transitions. [2018-11-18 10:58:53,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:58:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,606 INFO L225 Difference]: With dead ends: 3037 [2018-11-18 10:58:53,606 INFO L226 Difference]: Without dead ends: 1755 [2018-11-18 10:58:53,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2018-11-18 10:58:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2018-11-18 10:58:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-11-18 10:58:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2471 transitions. [2018-11-18 10:58:53,663 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2471 transitions. Word has length 25 [2018-11-18 10:58:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:53,663 INFO L480 AbstractCegarLoop]: Abstraction has 1753 states and 2471 transitions. [2018-11-18 10:58:53,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2471 transitions. [2018-11-18 10:58:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:58:53,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:53,665 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:53,665 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:53,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2116260660, now seen corresponding path program 1 times [2018-11-18 10:58:53,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:53,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,694 INFO L87 Difference]: Start difference. First operand 1753 states and 2471 transitions. Second operand 3 states. [2018-11-18 10:58:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,732 INFO L93 Difference]: Finished difference Result 2653 states and 3737 transitions. [2018-11-18 10:58:53,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:58:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,738 INFO L225 Difference]: With dead ends: 2653 [2018-11-18 10:58:53,738 INFO L226 Difference]: Without dead ends: 1803 [2018-11-18 10:58:53,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-11-18 10:58:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2018-11-18 10:58:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1801 states. [2018-11-18 10:58:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2503 transitions. [2018-11-18 10:58:53,794 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2503 transitions. Word has length 26 [2018-11-18 10:58:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:53,794 INFO L480 AbstractCegarLoop]: Abstraction has 1801 states and 2503 transitions. [2018-11-18 10:58:53,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2503 transitions. [2018-11-18 10:58:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:58:53,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:53,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:53,797 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:53,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1529454646, now seen corresponding path program 1 times [2018-11-18 10:58:53,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:53,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:53,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:53,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:53,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:53,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:53,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:53,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:53,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,831 INFO L87 Difference]: Start difference. First operand 1801 states and 2503 transitions. Second operand 3 states. [2018-11-18 10:58:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:53,910 INFO L93 Difference]: Finished difference Result 3085 states and 4329 transitions. [2018-11-18 10:58:53,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:53,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:58:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:53,919 INFO L225 Difference]: With dead ends: 3085 [2018-11-18 10:58:53,919 INFO L226 Difference]: Without dead ends: 3083 [2018-11-18 10:58:53,920 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-18 10:58:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2633. [2018-11-18 10:58:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2018-11-18 10:58:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3559 transitions. [2018-11-18 10:58:54,007 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3559 transitions. Word has length 26 [2018-11-18 10:58:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:54,008 INFO L480 AbstractCegarLoop]: Abstraction has 2633 states and 3559 transitions. [2018-11-18 10:58:54,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3559 transitions. [2018-11-18 10:58:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:58:54,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:54,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:54,011 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:54,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1787620084, now seen corresponding path program 1 times [2018-11-18 10:58:54,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:54,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:54,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:54,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:54,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:54,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:54,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:54,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,024 INFO L87 Difference]: Start difference. First operand 2633 states and 3559 transitions. Second operand 3 states. [2018-11-18 10:58:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:54,097 INFO L93 Difference]: Finished difference Result 6029 states and 8105 transitions. [2018-11-18 10:58:54,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:54,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:58:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:54,106 INFO L225 Difference]: With dead ends: 6029 [2018-11-18 10:58:54,106 INFO L226 Difference]: Without dead ends: 3467 [2018-11-18 10:58:54,110 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-18 10:58:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3465. [2018-11-18 10:58:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3465 states. [2018-11-18 10:58:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4551 transitions. [2018-11-18 10:58:54,199 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4551 transitions. Word has length 26 [2018-11-18 10:58:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:54,200 INFO L480 AbstractCegarLoop]: Abstraction has 3465 states and 4551 transitions. [2018-11-18 10:58:54,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4551 transitions. [2018-11-18 10:58:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 10:58:54,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:54,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:54,203 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:54,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash 168669521, now seen corresponding path program 1 times [2018-11-18 10:58:54,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:54,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:54,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:54,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:54,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,221 INFO L87 Difference]: Start difference. First operand 3465 states and 4551 transitions. Second operand 3 states. [2018-11-18 10:58:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:54,284 INFO L93 Difference]: Finished difference Result 5197 states and 6793 transitions. [2018-11-18 10:58:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:54,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 10:58:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:54,292 INFO L225 Difference]: With dead ends: 5197 [2018-11-18 10:58:54,293 INFO L226 Difference]: Without dead ends: 3531 [2018-11-18 10:58:54,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2018-11-18 10:58:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3529. [2018-11-18 10:58:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-11-18 10:58:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4551 transitions. [2018-11-18 10:58:54,393 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4551 transitions. Word has length 27 [2018-11-18 10:58:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:54,393 INFO L480 AbstractCegarLoop]: Abstraction has 3529 states and 4551 transitions. [2018-11-18 10:58:54,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4551 transitions. [2018-11-18 10:58:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 10:58:54,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:54,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:54,397 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:54,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash -418136493, now seen corresponding path program 1 times [2018-11-18 10:58:54,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:54,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:54,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:54,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:54,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:54,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:54,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,414 INFO L87 Difference]: Start difference. First operand 3529 states and 4551 transitions. Second operand 3 states. [2018-11-18 10:58:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:54,524 INFO L93 Difference]: Finished difference Result 5901 states and 7625 transitions. [2018-11-18 10:58:54,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:54,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 10:58:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:54,538 INFO L225 Difference]: With dead ends: 5901 [2018-11-18 10:58:54,538 INFO L226 Difference]: Without dead ends: 5899 [2018-11-18 10:58:54,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2018-11-18 10:58:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 5257. [2018-11-18 10:58:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5257 states. [2018-11-18 10:58:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 6599 transitions. [2018-11-18 10:58:54,655 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 6599 transitions. Word has length 27 [2018-11-18 10:58:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:54,655 INFO L480 AbstractCegarLoop]: Abstraction has 5257 states and 6599 transitions. [2018-11-18 10:58:54,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 6599 transitions. [2018-11-18 10:58:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 10:58:54,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:54,661 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:54,661 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:54,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash -159971055, now seen corresponding path program 1 times [2018-11-18 10:58:54,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:54,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:54,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:54,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:54,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:54,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:54,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,682 INFO L87 Difference]: Start difference. First operand 5257 states and 6599 transitions. Second operand 3 states. [2018-11-18 10:58:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:54,793 INFO L93 Difference]: Finished difference Result 11917 states and 14793 transitions. [2018-11-18 10:58:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:54,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 10:58:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:54,804 INFO L225 Difference]: With dead ends: 11917 [2018-11-18 10:58:54,804 INFO L226 Difference]: Without dead ends: 6795 [2018-11-18 10:58:54,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6795 states. [2018-11-18 10:58:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6795 to 6793. [2018-11-18 10:58:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-11-18 10:58:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 8199 transitions. [2018-11-18 10:58:54,992 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 8199 transitions. Word has length 27 [2018-11-18 10:58:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:54,992 INFO L480 AbstractCegarLoop]: Abstraction has 6793 states and 8199 transitions. [2018-11-18 10:58:54,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 8199 transitions. [2018-11-18 10:58:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:58:55,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:55,000 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:55,000 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:55,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash -77113303, now seen corresponding path program 1 times [2018-11-18 10:58:55,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:55,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:55,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:55,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:55,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:55,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:55,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:55,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:55,014 INFO L87 Difference]: Start difference. First operand 6793 states and 8199 transitions. Second operand 3 states. [2018-11-18 10:58:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:55,149 INFO L93 Difference]: Finished difference Result 10189 states and 12233 transitions. [2018-11-18 10:58:55,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:55,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:58:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:55,160 INFO L225 Difference]: With dead ends: 10189 [2018-11-18 10:58:55,160 INFO L226 Difference]: Without dead ends: 6923 [2018-11-18 10:58:55,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2018-11-18 10:58:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 6921. [2018-11-18 10:58:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6921 states. [2018-11-18 10:58:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 8199 transitions. [2018-11-18 10:58:55,315 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 8199 transitions. Word has length 28 [2018-11-18 10:58:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:55,315 INFO L480 AbstractCegarLoop]: Abstraction has 6921 states and 8199 transitions. [2018-11-18 10:58:55,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 8199 transitions. [2018-11-18 10:58:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:58:55,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:55,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:55,321 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:55,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:55,322 INFO L82 PathProgramCache]: Analyzing trace with hash -663919317, now seen corresponding path program 1 times [2018-11-18 10:58:55,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:55,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:55,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:55,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:55,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:55,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:55,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:55,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:55,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:55,334 INFO L87 Difference]: Start difference. First operand 6921 states and 8199 transitions. Second operand 3 states. [2018-11-18 10:58:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:55,508 INFO L93 Difference]: Finished difference Result 11275 states and 13192 transitions. [2018-11-18 10:58:55,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:55,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:58:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:55,524 INFO L225 Difference]: With dead ends: 11275 [2018-11-18 10:58:55,524 INFO L226 Difference]: Without dead ends: 11273 [2018-11-18 10:58:55,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2018-11-18 10:58:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 10505. [2018-11-18 10:58:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10505 states. [2018-11-18 10:58:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 12167 transitions. [2018-11-18 10:58:55,744 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 12167 transitions. Word has length 28 [2018-11-18 10:58:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:55,744 INFO L480 AbstractCegarLoop]: Abstraction has 10505 states and 12167 transitions. [2018-11-18 10:58:55,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 12167 transitions. [2018-11-18 10:58:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:58:55,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:58:55,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:58:55,755 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:58:55,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:58:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash -405753879, now seen corresponding path program 1 times [2018-11-18 10:58:55,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:58:55,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:58:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:58:55,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:58:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:58:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:58:55,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:58:55,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:58:55,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:58:55,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:58:55,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:58:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:55,770 INFO L87 Difference]: Start difference. First operand 10505 states and 12167 transitions. Second operand 3 states. [2018-11-18 10:58:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:58:55,982 INFO L93 Difference]: Finished difference Result 23561 states and 26759 transitions. [2018-11-18 10:58:55,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:58:55,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:58:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:58:55,982 INFO L225 Difference]: With dead ends: 23561 [2018-11-18 10:58:55,982 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:58:56,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:58:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:58:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:58:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:58:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:58:56,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-18 10:58:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:58:56,007 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:58:56,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:58:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:58:56,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:58:56,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:58:56,040 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 10:58:56,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:58:56,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:58:56,041 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 10:58:56,041 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:58:56,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:58:56,041 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,041 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-11-18 10:58:56,041 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,041 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-18 10:58:56,041 INFO L425 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,041 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L428 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,042 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,043 INFO L428 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-18 10:58:56,043 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-18 10:58:56,044 INFO L421 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-11-18 10:58:56,044 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,044 INFO L425 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,044 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-18 10:58:56,044 INFO L425 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-11-18 10:58:56,044 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,044 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:58:56,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:58:56 BoogieIcfgContainer [2018-11-18 10:58:56,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:58:56,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:58:56,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:58:56,050 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:58:56,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:58:52" (3/4) ... [2018-11-18 10:58:56,054 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:58:56,060 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:58:56,061 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:58:56,065 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 10:58:56,065 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 10:58:56,065 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 10:58:56,110 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9500fe1b-3cf9-4c0c-87c9-b823f9a59003/bin-2019/utaipan/witness.graphml [2018-11-18 10:58:56,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:58:56,112 INFO L168 Benchmark]: Toolchain (without parser) took 4322.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 963.4 MB in the beginning and 893.9 MB in the end (delta: 69.5 MB). Peak memory consumption was 411.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:58:56,113 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:58:56,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.90 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 947.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:58:56,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.14 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-11-18 10:58:56,114 INFO L168 Benchmark]: Boogie Preprocessor took 20.76 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-11-18 10:58:56,114 INFO L168 Benchmark]: RCFGBuilder took 264.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:58:56,114 INFO L168 Benchmark]: TraceAbstraction took 3793.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 905.5 MB in the end (delta: 222.8 MB). Peak memory consumption was 409.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:58:56,114 INFO L168 Benchmark]: Witness Printer took 60.15 ms. Allocated memory is still 1.4 GB. Free memory was 905.5 MB in the beginning and 893.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:58:56,116 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.90 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 947.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.14 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. * Boogie Preprocessor took 20.76 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 264.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3793.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 905.5 MB in the end (delta: 222.8 MB). Peak memory consumption was 409.4 MB. Max. memory is 11.5 GB. * Witness Printer took 60.15 ms. Allocated memory is still 1.4 GB. Free memory was 905.5 MB in the beginning and 893.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1990 SDtfs, 948 SDslu, 1336 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10505occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 25820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...