./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/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 5d33db1882917813547794c8974f871f0a78640e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 17:41:18,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:41:18,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:41:18,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:41:18,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:41:18,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:41:18,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:41:18,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:41:18,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:41:18,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:41:18,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:41:18,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:41:18,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:41:18,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:41:18,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:41:18,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:41:18,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:41:18,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:41:18,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:41:18,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:41:18,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:41:18,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:41:18,761 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:41:18,761 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:41:18,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:41:18,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:41:18,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:41:18,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:41:18,763 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:41:18,764 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:41:18,764 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:41:18,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:41:18,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:41:18,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:41:18,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:41:18,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:41:18,765 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 17:41:18,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:41:18,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:41:18,773 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:41:18,773 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:41:18,773 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:41:18,773 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:41:18,773 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:41:18,773 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:41:18,774 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:41:18,774 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:41:18,774 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:41:18,774 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:41:18,774 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:41:18,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:41:18,774 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:41:18,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 17:41:18,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:41:18,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:41:18,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:41:18,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:41:18,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:41:18,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:41:18,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 17:41:18,776 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:41:18,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:41:18,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:41:18,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 17:41:18,776 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_883b614e-a28a-4dc6-bac0-165703e21aa7/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 -> 5d33db1882917813547794c8974f871f0a78640e [2018-12-09 17:41:18,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:41:18,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:41:18,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:41:18,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:41:18,808 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:41:18,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c [2018-12-09 17:41:18,854 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/data/8c616907d/04e54168581549f3b6956669c1b00a78/FLAG7f35ef4d2 [2018-12-09 17:41:19,197 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:41:19,198 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c [2018-12-09 17:41:19,201 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/data/8c616907d/04e54168581549f3b6956669c1b00a78/FLAG7f35ef4d2 [2018-12-09 17:41:19,210 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/data/8c616907d/04e54168581549f3b6956669c1b00a78 [2018-12-09 17:41:19,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:41:19,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:41:19,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:41:19,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:41:19,216 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:41:19,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1441f7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19, skipping insertion in model container [2018-12-09 17:41:19,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:41:19,234 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:41:19,329 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:41:19,334 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:41:19,346 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:41:19,355 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:41:19,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19 WrapperNode [2018-12-09 17:41:19,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:41:19,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:41:19,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:41:19,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:41:19,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:41:19,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:41:19,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:41:19,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:41:19,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... [2018-12-09 17:41:19,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:41:19,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:41:19,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:41:19,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:41:19,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:41:19,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 17:41:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 17:41:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 17:41:19,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 17:41:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:41:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:41:19,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:41:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 17:41:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 17:41:19,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 17:41:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-09 17:41:19,450 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-09 17:41:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 17:41:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:41:19,562 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:41:19,562 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 17:41:19,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:19 BoogieIcfgContainer [2018-12-09 17:41:19,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:41:19,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:41:19,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:41:19,564 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:41:19,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:41:19" (1/3) ... [2018-12-09 17:41:19,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60329351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:19, skipping insertion in model container [2018-12-09 17:41:19,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:19" (2/3) ... [2018-12-09 17:41:19,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60329351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:19, skipping insertion in model container [2018-12-09 17:41:19,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:19" (3/3) ... [2018-12-09 17:41:19,566 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_true-unreach-call.c [2018-12-09 17:41:19,572 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:41:19,577 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 17:41:19,586 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 17:41:19,603 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:41:19,603 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 17:41:19,603 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:41:19,603 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:41:19,603 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:41:19,603 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:41:19,603 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:41:19,603 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:41:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-09 17:41:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 17:41:19,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:19,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:41:19,617 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:19,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:19,620 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-12-09 17:41:19,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:19,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:19,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:41:19,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:19,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 17:41:19,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:19,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 17:41:19,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 17:41:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 17:41:19,711 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-12-09 17:41:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:19,722 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-12-09 17:41:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 17:41:19,723 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-12-09 17:41:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:19,728 INFO L225 Difference]: With dead ends: 42 [2018-12-09 17:41:19,728 INFO L226 Difference]: Without dead ends: 20 [2018-12-09 17:41:19,730 INFO L631 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-12-09 17:41:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-09 17:41:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 17:41:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 17:41:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-09 17:41:19,750 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-12-09 17:41:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:19,751 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-09 17:41:19,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 17:41:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-09 17:41:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 17:41:19,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:19,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:41:19,751 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:19,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-12-09 17:41:19,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:41:19,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:19,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:41:19,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:19,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:41:19,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:41:19,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:41:19,786 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-12-09 17:41:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:19,799 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-09 17:41:19,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:41:19,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 17:41:19,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:19,800 INFO L225 Difference]: With dead ends: 34 [2018-12-09 17:41:19,800 INFO L226 Difference]: Without dead ends: 22 [2018-12-09 17:41:19,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:41:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-09 17:41:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-09 17:41:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 17:41:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-09 17:41:19,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-09 17:41:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:19,803 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-09 17:41:19,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:41:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-09 17:41:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 17:41:19,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:19,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:41:19,804 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:19,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:19,804 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-12-09 17:41:19,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:19,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:19,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:41:19,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:19,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:41:19,847 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-09 17:41:19,848 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [21], [24], [29], [32], [39], [42], [52], [55], [56], [57], [58], [59], [61], [62] [2018-12-09 17:41:19,867 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 17:41:19,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 17:41:20,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 17:41:20,007 INFO L272 AbstractInterpreter]: Visited 20 different actions 43 times. Merged at 11 different actions 17 times. Widened at 1 different actions 1 times. Performed 428 root evaluator evaluations with a maximum evaluation depth of 5. Performed 428 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 34 variables. [2018-12-09 17:41:20,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:20,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 17:41:20,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:20,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/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-12-09 17:41:20,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:20,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 17:41:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:20,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:41:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:41:20,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:41:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:41:20,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:41:20,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-09 17:41:20,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:41:20,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:41:20,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:41:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:41:20,099 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-12-09 17:41:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:20,118 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-09 17:41:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:41:20,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 17:41:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:20,119 INFO L225 Difference]: With dead ends: 36 [2018-12-09 17:41:20,119 INFO L226 Difference]: Without dead ends: 24 [2018-12-09 17:41:20,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:41:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-09 17:41:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-09 17:41:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 17:41:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-09 17:41:20,122 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-09 17:41:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:20,122 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-09 17:41:20,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:41:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-09 17:41:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 17:41:20,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:20,123 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:41:20,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:20,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:20,123 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-12-09 17:41:20,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:41:20,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:20,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:41:20,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 17:41:20,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 17:41:20,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:20,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 17:41:20,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 17:41:20,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 17:41:20,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-09 17:41:20,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 17:41:20,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:41:20,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 17:41:20,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 17:41:20,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 17:41:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 17:41:20,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:41:20,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 17:41:20,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-09 17:41:20,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,267 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:20,267 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:20,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 17:41:20,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:41:20,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:41:20,278 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 17:41:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 17:41:20,296 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 17:41:20,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 10 [2018-12-09 17:41:20,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:20,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:41:20,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:41:20,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:41:20,297 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2018-12-09 17:41:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:20,332 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-09 17:41:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:41:20,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 17:41:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:20,332 INFO L225 Difference]: With dead ends: 33 [2018-12-09 17:41:20,332 INFO L226 Difference]: Without dead ends: 25 [2018-12-09 17:41:20,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:41:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-09 17:41:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-09 17:41:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 17:41:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-09 17:41:20,335 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-09 17:41:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:20,335 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-09 17:41:20,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:41:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-09 17:41:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 17:41:20,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:20,336 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:41:20,336 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:20,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash -413303094, now seen corresponding path program 1 times [2018-12-09 17:41:20,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:41:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 17:41:20,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:20,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:41:20,364 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 17:41:20,364 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [21], [24], [29], [32], [34], [39], [42], [52], [55], [56], [57], [58], [59], [61], [62] [2018-12-09 17:41:20,365 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 17:41:20,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 17:41:20,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 17:41:20,404 INFO L272 AbstractInterpreter]: Visited 21 different actions 27 times. Merged at 2 different actions 4 times. Never widened. Performed 240 root evaluator evaluations with a maximum evaluation depth of 5. Performed 240 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 35 variables. [2018-12-09 17:41:20,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:20,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 17:41:20,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:20,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 17:41:20,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:20,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 17:41:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:20,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:41:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 17:41:20,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:41:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 17:41:20,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:41:20,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-09 17:41:20,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:41:20,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:41:20,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:41:20,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:41:20,479 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2018-12-09 17:41:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:20,496 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-09 17:41:20,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:41:20,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-09 17:41:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:20,497 INFO L225 Difference]: With dead ends: 42 [2018-12-09 17:41:20,497 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 17:41:20,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:41:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 17:41:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-09 17:41:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 17:41:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-09 17:41:20,500 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-09 17:41:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:20,500 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-09 17:41:20,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:41:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-09 17:41:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 17:41:20,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:20,501 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:41:20,501 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:20,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:20,501 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 2 times [2018-12-09 17:41:20,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:20,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:20,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 17:41:20,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:20,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:41:20,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 17:41:20,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 17:41:20,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:20,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 17:41:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 17:41:20,553 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 17:41:20,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 17:41:20,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 17:41:20,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:41:20,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 17:41:20,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 17:41:20,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 17:41:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 17:41:20,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:41:20,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 17:41:20,647 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:20,648 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:20,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 17:41:20,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-09 17:41:20,657 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:41:20,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:41:20,664 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 17:41:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 17:41:20,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:41:20,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-12-09 17:41:20,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:41:20,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 17:41:20,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 17:41:20,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:41:20,684 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2018-12-09 17:41:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:20,751 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-09 17:41:20,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 17:41:20,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-12-09 17:41:20,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:20,752 INFO L225 Difference]: With dead ends: 46 [2018-12-09 17:41:20,752 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 17:41:20,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-12-09 17:41:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 17:41:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-09 17:41:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 17:41:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-09 17:41:20,755 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2018-12-09 17:41:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:20,755 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-09 17:41:20,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 17:41:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-09 17:41:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 17:41:20,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:20,756 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:41:20,756 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:20,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:20,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1042968311, now seen corresponding path program 3 times [2018-12-09 17:41:20,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:20,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:41:20,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 17:41:20,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:20,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:41:20,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 17:41:20,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 17:41:20,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:20,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 17:41:20,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 17:41:20,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 17:41:20,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 17:41:20,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 17:41:20,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:41:20,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 17:41:20,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 17:41:20,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 17:41:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 17:41:20,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:41:20,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 17:41:20,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 17:41:20,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,954 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:20,955 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:20,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 17:41:20,956 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:20,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:41:20,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:41:20,962 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 17:41:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 17:41:20,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:41:20,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-12-09 17:41:20,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:41:20,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 17:41:20,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 17:41:20,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-09 17:41:20,983 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-12-09 17:41:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:21,046 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-09 17:41:21,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 17:41:21,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-12-09 17:41:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:21,047 INFO L225 Difference]: With dead ends: 52 [2018-12-09 17:41:21,047 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 17:41:21,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-12-09 17:41:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 17:41:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-09 17:41:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 17:41:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-09 17:41:21,051 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-12-09 17:41:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:21,051 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-09 17:41:21,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 17:41:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-09 17:41:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 17:41:21,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:21,052 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:41:21,052 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:21,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1283972954, now seen corresponding path program 4 times [2018-12-09 17:41:21,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:21,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:41:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:21,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 17:41:21,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:21,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:41:21,108 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 17:41:21,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 17:41:21,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:21,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 17:41:21,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:21,114 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 17:41:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:21,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:41:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 17:41:21,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:41:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 17:41:21,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:41:21,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-12-09 17:41:21,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:41:21,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:41:21,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:41:21,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:41:21,206 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 9 states. [2018-12-09 17:41:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:21,230 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-09 17:41:21,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:41:21,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-12-09 17:41:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:21,230 INFO L225 Difference]: With dead ends: 56 [2018-12-09 17:41:21,231 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 17:41:21,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:41:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 17:41:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-09 17:41:21,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 17:41:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-09 17:41:21,233 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-09 17:41:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:21,233 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-09 17:41:21,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:41:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-09 17:41:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 17:41:21,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:21,234 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:41:21,234 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:21,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1797098632, now seen corresponding path program 5 times [2018-12-09 17:41:21,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:21,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:21,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 17:41:21,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:21,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:41:21,291 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 17:41:21,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 17:41:21,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:21,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 17:41:21,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 17:41:21,299 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 17:41:21,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 17:41:21,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 17:41:21,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:41:21,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:41:21,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:41:21,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:21,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:21,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 17:41:21,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 17:41:21,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:21,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:21,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:21,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:20 [2018-12-09 17:41:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 17:41:21,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:41:21,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2018-12-09 17:41:21,562 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:21,563 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:21,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 17:41:21,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:21,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 17:41:21,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:21,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:41:21,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:41:21,580 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:17 [2018-12-09 17:41:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 17:41:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:41:21,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2018-12-09 17:41:21,611 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:41:21,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 17:41:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 17:41:21,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-12-09 17:41:21,612 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-12-09 17:41:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:21,845 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-12-09 17:41:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 17:41:21,846 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-12-09 17:41:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:21,846 INFO L225 Difference]: With dead ends: 56 [2018-12-09 17:41:21,846 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 17:41:21,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 17:41:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 17:41:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 17:41:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 17:41:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 17:41:21,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-12-09 17:41:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:21,848 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 17:41:21,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 17:41:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 17:41:21,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 17:41:21,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 17:41:21,886 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 17:41:21,886 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-09 17:41:21,887 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 17:41:21,887 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 17:41:21,887 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 17:41:21,887 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 17:41:21,887 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 17:41:21,887 INFO L444 ceAbstractionStarter]: At program point L37-4(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (let ((.cse2 (select (select |#memory_int| .cse0) .cse1))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset .cse1) (<= main_~i~0 .cse2) (<= .cse2 main_~i~0)))) [2018-12-09 17:41:21,887 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-12-09 17:41:21,887 INFO L448 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2018-12-09 17:41:21,887 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2018-12-09 17:41:21,887 INFO L444 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (= |main_~#cont~0.offset| 0) [2018-12-09 17:41:21,888 INFO L448 ceAbstractionStarter]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2018-12-09 17:41:21,888 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2018-12-09 17:41:21,888 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-09 17:41:21,888 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-12-09 17:41:21,888 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2018-12-09 17:41:21,888 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: true [2018-12-09 17:41:21,888 INFO L444 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2018-12-09 17:41:21,888 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2018-12-09 17:41:21,888 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 43) no Hoare annotation was computed. [2018-12-09 17:41:21,888 INFO L444 ceAbstractionStarter]: At program point L37-3(lines 37 39) the Hoare annotation is: (and (= main_~pa~0.base (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) [2018-12-09 17:41:21,888 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2018-12-09 17:41:21,888 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2018-12-09 17:41:21,888 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2018-12-09 17:41:21,892 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 17:41:21,893 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 17:41:21,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 17:41:21,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 17:41:21,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 17:41:21,895 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 17:41:21,896 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 17:41:21,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 17:41:21,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 17:41:21,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 17:41:21,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:41:21 BoogieIcfgContainer [2018-12-09 17:41:21,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 17:41:21,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 17:41:21,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 17:41:21,898 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 17:41:21,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:19" (3/4) ... [2018-12-09 17:41:21,901 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 17:41:21,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 17:41:21,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 17:41:21,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-12-09 17:41:21,907 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-09 17:41:21,907 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 17:41:21,907 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 17:41:21,931 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_883b614e-a28a-4dc6-bac0-165703e21aa7/bin-2019/utaipan/witness.graphml [2018-12-09 17:41:21,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 17:41:21,932 INFO L168 Benchmark]: Toolchain (without parser) took 2719.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 958.7 MB in the beginning and 1.0 GB in the end (delta: -55.9 MB). Peak memory consumption was 157.5 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:21,933 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:41:21,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.03 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:21,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.82 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 945.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:21,933 INFO L168 Benchmark]: Boogie Preprocessor took 47.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:21,934 INFO L168 Benchmark]: RCFGBuilder took 143.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:21,934 INFO L168 Benchmark]: TraceAbstraction took 2335.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.3 MB). Peak memory consumption was 170.1 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:21,934 INFO L168 Benchmark]: Witness Printer took 33.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:21,935 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.03 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.9 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 14.82 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 945.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 143.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2335.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.3 MB). Peak memory consumption was 170.1 MB. Max. memory is 11.5 GB. * Witness Printer took 33.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: 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: 37]: Loop Invariant [2018-12-09 17:41:21,937 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 17:41:21,938 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 17:41:21,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 17:41:21,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 17:41:21,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 17:41:21,938 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 17:41:21,938 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 17:41:21,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 17:41:21,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 17:41:21,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((pa == #memory_$Pointer$[cont][cont] && cont == 0) && i <= unknown-#memory_int-unknown[pa][pa]) && pa == #memory_$Pointer$[cont][cont] + 4 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: cont == 0 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 9 OverallIterations, 6 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 165 SDtfs, 41 SDslu, 518 SDs, 0 SdLazy, 330 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 18 PreInvPairs, 30 NumberOfFragments, 90 HoareAnnotationTreeSize, 18 FomulaSimplifications, 122 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 419 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 588 ConstructedInterpolants, 0 QuantifiedInterpolants, 48690 SizeOfPredicates, 84 NumberOfNonLiveVariables, 830 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 205/387 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...