./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/nested_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-industry-pattern/nested_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/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 61b7d6607ccac63dcd99f2b87de00fb6f01869a1 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 23:58:00,973 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:58:00,974 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:58:00,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:58:00,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:58:00,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:58:00,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:58:00,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:58:00,995 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:58:00,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:58:00,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:58:00,999 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:58:01,000 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:58:01,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:58:01,008 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:58:01,009 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:58:01,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:58:01,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:58:01,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:58:01,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:58:01,013 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:58:01,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:58:01,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:58:01,020 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:58:01,021 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:58:01,021 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:58:01,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:58:01,023 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:58:01,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:58:01,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:58:01,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:58:01,024 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:58:01,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:58:01,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:58:01,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:58:01,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:58:01,026 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:58:01,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:58:01,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:58:01,044 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:58:01,045 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:58:01,045 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:58:01,045 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:58:01,045 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:58:01,045 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:58:01,045 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:58:01,045 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:58:01,046 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:58:01,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:58:01,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:58:01,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:58:01,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:58:01,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:58:01,048 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:58:01,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:58:01,048 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:58:01,048 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:58:01,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:58:01,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:58:01,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:58:01,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:58:01,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:58:01,049 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:58:01,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:58:01,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:58:01,050 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:58:01,050 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:58:01,050 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:58:01,050 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:58:01,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:58:01,050 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:58:01,050 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_f1f971a1-c222-4713-90ff-9dc7d97fa340/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 -> 61b7d6607ccac63dcd99f2b87de00fb6f01869a1 [2018-10-26 23:58:01,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:58:01,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:58:01,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:58:01,110 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:58:01,110 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:58:01,111 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/../../sv-benchmarks/c/loop-industry-pattern/nested_true-unreach-call.c [2018-10-26 23:58:01,158 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/data/0511ce9c2/b5983e5986794e7d958d1557d8fb484b/FLAGd41846568 [2018-10-26 23:58:01,556 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:58:01,557 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/sv-benchmarks/c/loop-industry-pattern/nested_true-unreach-call.c [2018-10-26 23:58:01,563 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/data/0511ce9c2/b5983e5986794e7d958d1557d8fb484b/FLAGd41846568 [2018-10-26 23:58:01,576 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/data/0511ce9c2/b5983e5986794e7d958d1557d8fb484b [2018-10-26 23:58:01,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:58:01,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:58:01,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:58:01,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:58:01,590 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:58:01,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e579f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01, skipping insertion in model container [2018-10-26 23:58:01,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:58:01,620 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:58:01,773 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:58:01,777 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:58:01,793 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:58:01,806 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:58:01,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01 WrapperNode [2018-10-26 23:58:01,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:58:01,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:58:01,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:58:01,808 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:58:01,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:58:01,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:58:01,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:58:01,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:58:01,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... [2018-10-26 23:58:01,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:58:01,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:58:01,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:58:01,850 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:58:01,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:58:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:58:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:58:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-10-26 23:58:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-10-26 23:58:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:58:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:58:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:58:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:58:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 23:58:01,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-26 23:58:02,366 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:58:02,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:58:02 BoogieIcfgContainer [2018-10-26 23:58:02,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:58:02,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:58:02,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:58:02,371 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:58:02,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:58:01" (1/3) ... [2018-10-26 23:58:02,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b61d41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:58:02, skipping insertion in model container [2018-10-26 23:58:02,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:58:01" (2/3) ... [2018-10-26 23:58:02,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b61d41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:58:02, skipping insertion in model container [2018-10-26 23:58:02,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:58:02" (3/3) ... [2018-10-26 23:58:02,374 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-10-26 23:58:02,384 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:58:02,390 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:58:02,405 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:58:02,444 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:58:02,444 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:58:02,445 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:58:02,445 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:58:02,445 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:58:02,445 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:58:02,445 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:58:02,445 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:58:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-26 23:58:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 23:58:02,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:02,478 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:02,481 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:02,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1030098894, now seen corresponding path program 1 times [2018-10-26 23:58:02,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:02,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:02,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:02,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:02,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:02,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:58:02,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 23:58:02,610 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:02,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 23:58:02,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 23:58:02,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 23:58:02,627 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-10-26 23:58:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:02,643 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2018-10-26 23:58:02,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 23:58:02,645 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-26 23:58:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:02,651 INFO L225 Difference]: With dead ends: 44 [2018-10-26 23:58:02,651 INFO L226 Difference]: Without dead ends: 25 [2018-10-26 23:58:02,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 23:58:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-26 23:58:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-26 23:58:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-26 23:58:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-10-26 23:58:02,686 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2018-10-26 23:58:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:02,687 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-26 23:58:02,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 23:58:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-10-26 23:58:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 23:58:02,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:02,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:02,688 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:02,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1176183033, now seen corresponding path program 1 times [2018-10-26 23:58:02,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:02,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:02,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:02,690 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:02,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:58:02,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:58:02,745 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:02,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:58:02,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:58:02,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:58:02,747 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-10-26 23:58:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:02,831 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-10-26 23:58:02,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:58:02,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 23:58:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:02,833 INFO L225 Difference]: With dead ends: 46 [2018-10-26 23:58:02,833 INFO L226 Difference]: Without dead ends: 31 [2018-10-26 23:58:02,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:58:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-26 23:58:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-10-26 23:58:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-26 23:58:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-10-26 23:58:02,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2018-10-26 23:58:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:02,839 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-26 23:58:02,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:58:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-10-26 23:58:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 23:58:02,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:02,840 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:02,840 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:02,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:02,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1045124110, now seen corresponding path program 1 times [2018-10-26 23:58:02,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:02,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:02,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:02,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:02,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:02,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:02,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:58:02,905 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-26 23:58:02,907 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-26 23:58:02,955 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:58:02,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:58:03,191 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:58:03,192 INFO L272 AbstractInterpreter]: Visited 18 different actions 66 times. Merged at 4 different actions 38 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-26 23:58:03,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:03,235 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:58:03,319 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 62.04% of their original sizes. [2018-10-26 23:58:03,320 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:58:03,620 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-10-26 23:58:03,620 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:58:03,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:58:03,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-26 23:58:03,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:03,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:58:03,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:58:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:58:03,623 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-10-26 23:58:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:04,034 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-10-26 23:58:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:58:04,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-26 23:58:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:04,036 INFO L225 Difference]: With dead ends: 58 [2018-10-26 23:58:04,036 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 23:58:04,037 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:58:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 23:58:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-10-26 23:58:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-26 23:58:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-10-26 23:58:04,046 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2018-10-26 23:58:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:04,046 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-10-26 23:58:04,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:58:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-10-26 23:58:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 23:58:04,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:04,049 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:04,049 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:04,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:04,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1102382412, now seen corresponding path program 1 times [2018-10-26 23:58:04,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:04,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:04,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:04,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:04,164 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:58:04,164 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-26 23:58:04,165 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-26 23:58:04,166 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:58:04,166 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:58:04,250 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:58:04,250 INFO L272 AbstractInterpreter]: Visited 22 different actions 60 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-26 23:58:04,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:04,255 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:58:04,307 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 60.23% of their original sizes. [2018-10-26 23:58:04,308 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:58:04,655 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-10-26 23:58:04,655 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:58:04,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:58:04,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-10-26 23:58:04,656 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:04,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 23:58:04,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 23:58:04,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:58:04,657 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 10 states. [2018-10-26 23:58:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:05,402 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-10-26 23:58:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:58:05,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-26 23:58:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:05,403 INFO L225 Difference]: With dead ends: 66 [2018-10-26 23:58:05,404 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 23:58:05,404 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:58:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 23:58:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-10-26 23:58:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-26 23:58:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-10-26 23:58:05,414 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 24 [2018-10-26 23:58:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:05,414 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-10-26 23:58:05,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 23:58:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-10-26 23:58:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 23:58:05,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:05,415 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:05,415 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:05,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1438151120, now seen corresponding path program 1 times [2018-10-26 23:58:05,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:05,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:05,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:05,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:05,417 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:05,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:05,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:58:05,537 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-26 23:58:05,537 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-26 23:58:05,538 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:58:05,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:58:05,549 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:58:05,549 INFO L272 AbstractInterpreter]: Visited 17 different actions 21 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-26 23:58:05,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:05,556 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:58:05,585 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 67.65% of their original sizes. [2018-10-26 23:58:05,586 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:58:05,819 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-10-26 23:58:05,819 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:58:05,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:58:05,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-26 23:58:05,820 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:05,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:58:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:58:05,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:58:05,821 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2018-10-26 23:58:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:06,184 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-10-26 23:58:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:58:06,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-26 23:58:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:06,188 INFO L225 Difference]: With dead ends: 71 [2018-10-26 23:58:06,188 INFO L226 Difference]: Without dead ends: 54 [2018-10-26 23:58:06,189 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:58:06,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-26 23:58:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-26 23:58:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 23:58:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-10-26 23:58:06,205 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2018-10-26 23:58:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:06,206 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-10-26 23:58:06,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:58:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-10-26 23:58:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 23:58:06,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:06,207 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:06,207 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:06,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1472263337, now seen corresponding path program 1 times [2018-10-26 23:58:06,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:06,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:06,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:06,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:06,363 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:58:06,363 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-26 23:58:06,364 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-26 23:58:06,365 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:58:06,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:58:06,461 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:58:06,461 INFO L272 AbstractInterpreter]: Visited 23 different actions 95 times. Merged at 6 different actions 51 times. Widened at 1 different actions 7 times. Found 13 fixpoints after 4 different actions. Largest state had 8 variables. [2018-10-26 23:58:06,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:06,505 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:58:06,541 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 58.01% of their original sizes. [2018-10-26 23:58:06,541 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:58:06,886 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-10-26 23:58:06,886 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:58:06,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:58:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-10-26 23:58:06,887 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:06,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 23:58:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 23:58:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:58:06,888 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 12 states. [2018-10-26 23:58:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:07,459 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-10-26 23:58:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 23:58:07,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-26 23:58:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:07,460 INFO L225 Difference]: With dead ends: 78 [2018-10-26 23:58:07,461 INFO L226 Difference]: Without dead ends: 61 [2018-10-26 23:58:07,461 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:58:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-26 23:58:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-10-26 23:58:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-26 23:58:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-10-26 23:58:07,472 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 28 [2018-10-26 23:58:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:07,472 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-10-26 23:58:07,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 23:58:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-10-26 23:58:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 23:58:07,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:07,473 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:07,473 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:07,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1415005035, now seen corresponding path program 1 times [2018-10-26 23:58:07,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:07,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:07,477 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:07,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:07,736 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:58:07,736 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-26 23:58:07,736 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-26 23:58:07,737 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:58:07,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:58:07,795 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:58:07,795 INFO L272 AbstractInterpreter]: Visited 23 different actions 92 times. Merged at 8 different actions 48 times. Widened at 1 different actions 6 times. Found 11 fixpoints after 3 different actions. Largest state had 8 variables. [2018-10-26 23:58:07,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:07,803 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:58:07,833 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 58.01% of their original sizes. [2018-10-26 23:58:07,833 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:58:08,053 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-10-26 23:58:08,053 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:58:08,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:58:08,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-10-26 23:58:08,054 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:08,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 23:58:08,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 23:58:08,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:58:08,055 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 12 states. [2018-10-26 23:58:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:08,631 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-10-26 23:58:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 23:58:08,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-26 23:58:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:08,632 INFO L225 Difference]: With dead ends: 69 [2018-10-26 23:58:08,632 INFO L226 Difference]: Without dead ends: 67 [2018-10-26 23:58:08,632 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:58:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-26 23:58:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-10-26 23:58:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-26 23:58:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-10-26 23:58:08,643 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 28 [2018-10-26 23:58:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:08,643 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-10-26 23:58:08,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 23:58:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-10-26 23:58:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 23:58:08,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:08,644 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:08,644 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:08,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1416852077, now seen corresponding path program 1 times [2018-10-26 23:58:08,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:08,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:08,645 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:08,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:08,896 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:58:08,896 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-26 23:58:08,896 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [46], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-26 23:58:08,897 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:58:08,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:58:08,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:58:08,975 INFO L272 AbstractInterpreter]: Visited 24 different actions 90 times. Merged at 7 different actions 47 times. Widened at 1 different actions 6 times. Found 12 fixpoints after 4 different actions. Largest state had 8 variables. [2018-10-26 23:58:08,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:08,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:58:08,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:08,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:58:09,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:09,003 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:58:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:09,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:58:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:09,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:58:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:09,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:58:09,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-26 23:58:09,152 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:58:09,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:58:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:58:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:58:09,153 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 5 states. [2018-10-26 23:58:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:09,337 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2018-10-26 23:58:09,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:58:09,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-10-26 23:58:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:09,338 INFO L225 Difference]: With dead ends: 112 [2018-10-26 23:58:09,339 INFO L226 Difference]: Without dead ends: 86 [2018-10-26 23:58:09,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:58:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-26 23:58:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2018-10-26 23:58:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-26 23:58:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-10-26 23:58:09,355 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 28 [2018-10-26 23:58:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:09,355 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-10-26 23:58:09,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:58:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2018-10-26 23:58:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 23:58:09,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:09,356 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:09,356 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:09,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1098052710, now seen corresponding path program 2 times [2018-10-26 23:58:09,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:09,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:09,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:09,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:09,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:58:09,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:09,422 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:58:09,423 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 23:58:09,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 23:58:09,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:09,423 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 23:58:09,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 23:58:09,435 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:58:09,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 23:58:09,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:58:09,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:58:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 23:58:09,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:58:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 23:58:09,578 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:58:09,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 10 [2018-10-26 23:58:09,578 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:09,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:58:09,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:58:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:58:09,579 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 5 states. [2018-10-26 23:58:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:09,711 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2018-10-26 23:58:09,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:58:09,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-10-26 23:58:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:09,712 INFO L225 Difference]: With dead ends: 131 [2018-10-26 23:58:09,712 INFO L226 Difference]: Without dead ends: 106 [2018-10-26 23:58:09,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:58:09,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-26 23:58:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-10-26 23:58:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-26 23:58:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2018-10-26 23:58:09,729 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 32 [2018-10-26 23:58:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:09,729 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2018-10-26 23:58:09,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:58:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2018-10-26 23:58:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 23:58:09,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:09,732 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:09,732 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:09,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:09,733 INFO L82 PathProgramCache]: Analyzing trace with hash 844843622, now seen corresponding path program 1 times [2018-10-26 23:58:09,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:09,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:58:09,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:09,734 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:58:09,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:09,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:58:09,793 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-10-26 23:58:09,793 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-26 23:58:09,795 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:58:09,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:58:10,014 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:58:10,014 INFO L272 AbstractInterpreter]: Visited 26 different actions 413 times. Merged at 10 different actions 229 times. Widened at 3 different actions 44 times. Found 24 fixpoints after 5 different actions. Largest state had 8 variables. [2018-10-26 23:58:10,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:10,051 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:58:10,110 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 39.47% of their original sizes. [2018-10-26 23:58:10,110 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:58:10,742 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-10-26 23:58:10,742 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:58:10,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:58:10,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-26 23:58:10,743 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:10,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:58:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:58:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:58:10,744 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 14 states. [2018-10-26 23:58:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:11,675 INFO L93 Difference]: Finished difference Result 192 states and 237 transitions. [2018-10-26 23:58:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 23:58:11,675 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-10-26 23:58:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:11,677 INFO L225 Difference]: With dead ends: 192 [2018-10-26 23:58:11,677 INFO L226 Difference]: Without dead ends: 144 [2018-10-26 23:58:11,678 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-26 23:58:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-26 23:58:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 112. [2018-10-26 23:58:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-26 23:58:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2018-10-26 23:58:11,703 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 55 [2018-10-26 23:58:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:11,703 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2018-10-26 23:58:11,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:58:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2018-10-26 23:58:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 23:58:11,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:58:11,706 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:58:11,706 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:58:11,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1237870632, now seen corresponding path program 1 times [2018-10-26 23:58:11,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:58:11,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:11,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:58:11,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:58:11,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:58:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:58:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 54 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:58:11,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:58:11,944 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:58:11,945 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-10-26 23:58:11,945 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-26 23:58:11,946 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:58:11,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:58:12,358 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:58:12,360 INFO L272 AbstractInterpreter]: Visited 27 different actions 554 times. Merged at 12 different actions 271 times. Widened at 3 different actions 39 times. Found 72 fixpoints after 8 different actions. Largest state had 8 variables. [2018-10-26 23:58:12,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:58:12,389 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:58:12,443 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 42.92% of their original sizes. [2018-10-26 23:58:12,444 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:58:12,750 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-10-26 23:58:12,750 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:58:12,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:58:12,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-10-26 23:58:12,750 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:58:12,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 23:58:12,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 23:58:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-10-26 23:58:12,751 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 17 states. [2018-10-26 23:58:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:58:13,367 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2018-10-26 23:58:13,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 23:58:13,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-10-26 23:58:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:58:13,368 INFO L225 Difference]: With dead ends: 119 [2018-10-26 23:58:13,368 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 23:58:13,369 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-10-26 23:58:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 23:58:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 23:58:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 23:58:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 23:58:13,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-10-26 23:58:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:58:13,369 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 23:58:13,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 23:58:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 23:58:13,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 23:58:13,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 23:58:13,517 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 119 [2018-10-26 23:58:13,819 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-26 23:58:14,147 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-10-26 23:58:15,215 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 126 DAG size of output: 44 [2018-10-26 23:58:15,500 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 57 [2018-10-26 23:58:15,739 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 45 [2018-10-26 23:58:15,744 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 23:58:15,744 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-26 23:58:15,744 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:58:15,744 INFO L425 ceAbstractionStarter]: For program point nondetFINAL(lines 15 19) no Hoare annotation was computed. [2018-10-26 23:58:15,744 INFO L428 ceAbstractionStarter]: At program point nondetENTRY(lines 15 19) the Hoare annotation is: true [2018-10-26 23:58:15,744 INFO L425 ceAbstractionStarter]: For program point nondetEXIT(lines 15 19) no Hoare annotation was computed. [2018-10-26 23:58:15,744 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:58:15,744 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ (* 2 ~last~0) 4294967296)) (<= ~last~0 199999)) [2018-10-26 23:58:15,745 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 23:58:15,745 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 23:58:15,745 INFO L421 ceAbstractionStarter]: At program point L33(lines 24 34) the Hoare annotation is: (let ((.cse0 (* 2 main_~c~0)) (.cse1 (+ main_~st~0 199999))) (let ((.cse2 (<= main_~a~0 main_~b~0)) (.cse3 (<= main_~b~0 main_~a~0)) (.cse4 (<= .cse1 main_~c~0)) (.cse5 (<= .cse0 400000)) (.cse6 (<= 0 (+ ~last~0 main_~st~0 2147483647))) (.cse7 (<= 2 (+ main_~a~0 main_~st~0)))) (or (< (+ (* 2 |old(~last~0)|) 4294967296) 0) (and (<= 400000 .cse0) (<= main_~c~0 .cse1) .cse2 .cse3 .cse4 (= (mod main_~a~0 2) 0) .cse5 .cse6 (<= (+ ~last~0 main_~c~0) 2147683647) .cse7) (and (and (= main_~b~0 0) (<= (+ main_~a~0 main_~b~0) 0) (<= main_~c~0 main_~a~0)) (<= (+ ~last~0 main_~b~0) 2147483647) (<= main_~b~0 main_~c~0) (<= 0 (+ ~last~0 main_~a~0 2147483648))) (and (<= 200000 (+ main_~st~0 main_~c~0)) (<= ~last~0 199999) .cse2 .cse3 .cse4 .cse5 (<= (+ main_~st~0 1) main_~a~0) .cse6 .cse7) (< 199999 |old(~last~0)|)))) [2018-10-26 23:58:15,745 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 31 32) the Hoare annotation is: (let ((.cse0 (* 2 main_~c~0)) (.cse1 (+ main_~st~0 199999))) (let ((.cse2 (<= main_~a~0 main_~b~0)) (.cse3 (<= main_~b~0 main_~a~0)) (.cse4 (<= .cse1 main_~c~0)) (.cse5 (<= .cse0 400000)) (.cse6 (<= 0 (+ ~last~0 main_~st~0 2147483647))) (.cse7 (<= 2 (+ main_~a~0 main_~st~0)))) (or (and (<= 400000 .cse0) (<= main_~c~0 .cse1) .cse2 .cse3 .cse4 (= (mod main_~a~0 2) 0) .cse5 .cse6 (<= (+ ~last~0 main_~c~0) 2147683647) .cse7) (< (+ (* 2 |old(~last~0)|) 4294967296) 0) (and (<= 200000 (+ main_~st~0 main_~c~0)) (<= ~last~0 199999) .cse2 .cse3 .cse4 .cse5 (<= (+ main_~st~0 1) main_~a~0) .cse6 .cse7) (< 199999 |old(~last~0)|)))) [2018-10-26 23:58:15,745 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-26 23:58:15,745 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-10-26 23:58:15,745 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (or (< (+ (* 2 |old(~last~0)|) 4294967296) 0) (and (<= 0 (+ (* 2 ~last~0) 4294967296)) (<= ~last~0 199999)) (< 199999 |old(~last~0)|)) [2018-10-26 23:58:15,745 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 24 34) no Hoare annotation was computed. [2018-10-26 23:58:15,746 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2018-10-26 23:58:15,746 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 34) no Hoare annotation was computed. [2018-10-26 23:58:15,746 INFO L425 ceAbstractionStarter]: For program point L26-3(lines 26 27) no Hoare annotation was computed. [2018-10-26 23:58:15,746 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-26 23:58:15,746 INFO L421 ceAbstractionStarter]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse1 (* 2 main_~st~0))) (let ((.cse0 (<= .cse1 2)) (.cse2 (<= 1 (+ main_~st~0 main_~c~0))) (.cse3 (<= main_~a~0 main_~b~0)) (.cse4 (<= main_~b~0 main_~a~0)) (.cse5 (<= (* 2 main_~c~0) 400000)) (.cse6 (<= 0 (+ ~last~0 main_~st~0 2147483647))) (.cse7 (<= 0 (+ main_~a~0 main_~st~0)))) (or (and .cse0 (<= 2 .cse1) .cse2 .cse3 (<= (* 2 ~last~0) 4294967294) .cse4 (= (mod main_~a~0 2) 0) .cse5 .cse6 .cse7) (< (+ (* 2 |old(~last~0)|) 4294967296) 0) (and .cse0 (<= 0 .cse1) (<= ~last~0 199999) .cse2 .cse3 .cse4 .cse5 .cse6 (<= main_~st~0 (+ main_~b~0 1)) .cse7) (< 199999 |old(~last~0)|)))) [2018-10-26 23:58:15,746 INFO L425 ceAbstractionStarter]: For program point L26-5(lines 24 34) no Hoare annotation was computed. [2018-10-26 23:58:15,746 INFO L425 ceAbstractionStarter]: For program point L24-3(lines 21 35) no Hoare annotation was computed. [2018-10-26 23:58:15,746 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2018-10-26 23:58:15,747 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-10-26 23:58:15,748 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-10-26 23:58:15,748 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2018-10-26 23:58:15,748 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-10-26 23:58:15,748 INFO L425 ceAbstractionStarter]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2018-10-26 23:58:15,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:58:15 BoogieIcfgContainer [2018-10-26 23:58:15,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:58:15,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:58:15,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:58:15,760 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:58:15,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:58:02" (3/4) ... [2018-10-26 23:58:15,766 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 23:58:15,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 23:58:15,771 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet [2018-10-26 23:58:15,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 23:58:15,772 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-26 23:58:15,776 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-10-26 23:58:15,776 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-10-26 23:58:15,800 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 * \old(last) + 4294967296 < 0 || (((((((((400000 <= 2 * c && c <= st + 199999) && a <= b) && b <= a) && st + 199999 <= c) && a % 2 == 0) && 2 * c <= 400000) && 0 <= last + st + 2147483647) && last + c <= 2147683647) && 2 <= a + st)) || (((((b == 0 && a + b <= 0) && c <= a) && last + b <= 2147483647) && b <= c) && 0 <= last + a + 2147483648)) || ((((((((200000 <= st + c && last <= 199999) && a <= b) && b <= a) && st + 199999 <= c) && 2 * c <= 400000) && st + 1 <= a) && 0 <= last + st + 2147483647) && 2 <= a + st)) || 199999 < \old(last) [2018-10-26 23:58:15,801 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 * st <= 2 && 2 <= 2 * st) && 1 <= st + c) && a <= b) && 2 * last <= 4294967294) && b <= a) && a % 2 == 0) && 2 * c <= 400000) && 0 <= last + st + 2147483647) && 0 <= a + st) || 2 * \old(last) + 4294967296 < 0) || (((((((((2 * st <= 2 && 0 <= 2 * st) && last <= 199999) && 1 <= st + c) && a <= b) && b <= a) && 2 * c <= 400000) && 0 <= last + st + 2147483647) && st <= b + 1) && 0 <= a + st)) || 199999 < \old(last) [2018-10-26 23:58:15,822 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f1f971a1-c222-4713-90ff-9dc7d97fa340/bin-2019/utaipan/witness.graphml [2018-10-26 23:58:15,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:58:15,823 INFO L168 Benchmark]: Toolchain (without parser) took 14241.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -193.7 MB). Peak memory consumption was 153.3 MB. Max. memory is 11.5 GB. [2018-10-26 23:58:15,824 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:58:15,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.21 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:58:15,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 951.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:58:15,824 INFO L168 Benchmark]: Boogie Preprocessor took 23.68 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:58:15,825 INFO L168 Benchmark]: RCFGBuilder took 517.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:58:15,825 INFO L168 Benchmark]: TraceAbstraction took 13391.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.5 MB). Peak memory consumption was 468.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:58:15,825 INFO L168 Benchmark]: Witness Printer took 63.00 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:58:15,827 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.21 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.82 ms. Allocated memory is still 1.0 GB. Free memory is still 951.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.68 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 517.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13391.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.5 MB). Peak memory consumption was 468.0 MB. Max. memory is 11.5 GB. * Witness Printer took 63.00 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 26]: Loop Invariant Derived loop invariant: (((((((((((2 * st <= 2 && 2 <= 2 * st) && 1 <= st + c) && a <= b) && 2 * last <= 4294967294) && b <= a) && a % 2 == 0) && 2 * c <= 400000) && 0 <= last + st + 2147483647) && 0 <= a + st) || 2 * \old(last) + 4294967296 < 0) || (((((((((2 * st <= 2 && 0 <= 2 * st) && last <= 199999) && 1 <= st + c) && a <= b) && b <= a) && 2 * c <= 400000) && 0 <= last + st + 2147483647) && st <= b + 1) && 0 <= a + st)) || 199999 < \old(last) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((2 * \old(last) + 4294967296 < 0 || (((((((((400000 <= 2 * c && c <= st + 199999) && a <= b) && b <= a) && st + 199999 <= c) && a % 2 == 0) && 2 * c <= 400000) && 0 <= last + st + 2147483647) && last + c <= 2147683647) && 2 <= a + st)) || (((((b == 0 && a + b <= 0) && c <= a) && last + b <= 2147483647) && b <= c) && 0 <= last + a + 2147483648)) || ((((((((200000 <= st + c && last <= 199999) && a <= b) && b <= a) && st + 199999 <= c) && 2 * c <= 400000) && st + 1 <= a) && 0 <= last + st + 2147483647) && 2 <= a + st)) || 199999 < \old(last) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. SAFE Result, 13.3s OverallTime, 11 OverallIterations, 8 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 266 SDslu, 645 SDs, 0 SdLazy, 308 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 374 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9096320346320347 AbsIntWeakeningRatio, 0.5281385281385281 AbsIntAvgWeakeningVarsNumRemoved, 19.874458874458874 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 92 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 24 PreInvPairs, 51 NumberOfFragments, 377 HoareAnnotationTreeSize, 24 FomulaSimplifications, 14130 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2066 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 397 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 24902 SizeOfPredicates, 6 NumberOfNonLiveVariables, 147 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 194/286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...