./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/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_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/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-aa41828 [2018-11-22 23:24:38,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:24:38,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:24:38,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:24:38,714 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:24:38,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:24:38,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:24:38,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:24:38,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:24:38,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:24:38,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:24:38,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:24:38,719 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:24:38,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:24:38,721 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:24:38,721 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:24:38,722 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:24:38,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:24:38,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:24:38,725 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:24:38,725 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:24:38,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:24:38,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:24:38,728 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:24:38,728 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:24:38,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:24:38,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:24:38,729 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:24:38,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:24:38,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:24:38,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:24:38,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:24:38,731 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:24:38,731 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:24:38,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:24:38,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:24:38,733 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 23:24:38,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:24:38,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:24:38,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:24:38,743 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:24:38,743 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 23:24:38,743 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 23:24:38,743 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 23:24:38,744 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 23:24:38,744 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 23:24:38,744 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 23:24:38,744 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 23:24:38,744 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 23:24:38,744 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 23:24:38,745 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:24:38,745 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:24:38,745 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:24:38,745 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:24:38,745 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:24:38,745 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:24:38,746 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:24:38,746 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:24:38,746 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:24:38,746 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:24:38,746 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:24:38,746 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:24:38,746 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:24:38,747 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:24:38,747 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:24:38,747 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:24:38,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:24:38,747 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:24:38,747 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:24:38,747 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:24:38,748 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 23:24:38,748 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:24:38,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:24:38,748 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 23:24:38,748 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_9caf319e-de33-433a-aaae-8de48d30120a/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-11-22 23:24:38,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:24:38,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:24:38,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:24:38,784 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:24:38,785 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:24:38,785 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c [2018-11-22 23:24:38,819 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/data/9077d87c8/422bb960fedb4fbfa405154bfa43e247/FLAGb6e08233b [2018-11-22 23:24:39,205 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:24:39,205 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/sv-benchmarks/c/ldv-regression/test25_true-unreach-call.c [2018-11-22 23:24:39,209 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/data/9077d87c8/422bb960fedb4fbfa405154bfa43e247/FLAGb6e08233b [2018-11-22 23:24:39,217 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/data/9077d87c8/422bb960fedb4fbfa405154bfa43e247 [2018-11-22 23:24:39,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:24:39,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:24:39,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:24:39,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:24:39,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:24:39,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a16ae76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39, skipping insertion in model container [2018-11-22 23:24:39,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:24:39,242 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:24:39,345 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:24:39,350 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:24:39,363 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:24:39,374 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:24:39,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39 WrapperNode [2018-11-22 23:24:39,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:24:39,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:24:39,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:24:39,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:24:39,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:24:39,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:24:39,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:24:39,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:24:39,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... [2018-11-22 23:24:39,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:24:39,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:24:39,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:24:39,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:24:39,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:24:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:24:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 23:24:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:24:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:24:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:24:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:24:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-22 23:24:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-22 23:24:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 23:24:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:24:39,682 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:24:39,682 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 23:24:39,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:24:39 BoogieIcfgContainer [2018-11-22 23:24:39,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:24:39,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:24:39,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:24:39,686 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:24:39,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:24:39" (1/3) ... [2018-11-22 23:24:39,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3128c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:24:39, skipping insertion in model container [2018-11-22 23:24:39,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:24:39" (2/3) ... [2018-11-22 23:24:39,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3128c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:24:39, skipping insertion in model container [2018-11-22 23:24:39,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:24:39" (3/3) ... [2018-11-22 23:24:39,688 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_true-unreach-call.c [2018-11-22 23:24:39,696 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:24:39,704 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:24:39,715 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:24:39,734 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:24:39,734 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:24:39,734 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:24:39,734 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:24:39,734 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:24:39,734 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:24:39,734 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:24:39,734 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:24:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-22 23:24:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 23:24:39,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:24:39,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:24:39,749 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:24:39,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:39,752 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-11-22 23:24:39,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:24:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:39,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:39,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:24:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:24:39,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:24:39,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:24:39,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:24:39,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 23:24:39,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 23:24:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 23:24:39,852 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-22 23:24:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:24:39,863 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-22 23:24:39,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 23:24:39,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-22 23:24:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:24:39,869 INFO L225 Difference]: With dead ends: 42 [2018-11-22 23:24:39,869 INFO L226 Difference]: Without dead ends: 20 [2018-11-22 23:24:39,871 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-11-22 23:24:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-22 23:24:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-22 23:24:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-22 23:24:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-22 23:24:39,892 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-22 23:24:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:24:39,892 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-22 23:24:39,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 23:24:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-22 23:24:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 23:24:39,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:24:39,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:24:39,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:24:39,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-11-22 23:24:39,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:24:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:39,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:39,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:24:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:24:39,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:24:39,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:24:39,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:24:39,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:24:39,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:24:39,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:24:39,949 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-22 23:24:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:24:39,963 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-22 23:24:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:24:39,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-22 23:24:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:24:39,963 INFO L225 Difference]: With dead ends: 34 [2018-11-22 23:24:39,964 INFO L226 Difference]: Without dead ends: 22 [2018-11-22 23:24:39,964 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-11-22 23:24:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-22 23:24:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-22 23:24:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 23:24:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-22 23:24:39,967 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-22 23:24:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:24:39,967 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-22 23:24:39,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:24:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-22 23:24:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 23:24:39,968 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:24:39,968 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-11-22 23:24:39,968 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:24:39,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-11-22 23:24:39,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:24:39,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:39,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:39,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:39,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:24:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:24:40,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:40,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:24:40,017 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-22 23:24:40,019 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [21], [24], [29], [32], [39], [42], [52], [55], [56], [57], [58], [59], [61], [62] [2018-11-22 23:24:40,042 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:24:40,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:24:40,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:24:40,210 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-11-22 23:24:40,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:40,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:24:40,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:40,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/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-11-22 23:24:40,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:40,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:24:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:40,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:24:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:24:40,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:24:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:24:40,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:24:40,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-22 23:24:40,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:24:40,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:24:40,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:24:40,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:24:40,342 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-22 23:24:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:24:40,373 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-22 23:24:40,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:24:40,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-22 23:24:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:24:40,375 INFO L225 Difference]: With dead ends: 36 [2018-11-22 23:24:40,375 INFO L226 Difference]: Without dead ends: 24 [2018-11-22 23:24:40,375 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-11-22 23:24:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-22 23:24:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-22 23:24:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 23:24:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-22 23:24:40,379 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-22 23:24:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:24:40,379 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-22 23:24:40,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:24:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-22 23:24:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 23:24:40,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:24:40,380 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-11-22 23:24:40,380 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:24:40,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:40,380 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-11-22 23:24:40,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:24:40,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:40,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:40,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:40,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:24:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:24:40,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:40,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:24:40,455 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:24:40,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:24:40,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:40,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/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-11-22 23:24:40,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:24:40,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:24:40,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-22 23:24:40,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:24:40,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:24:40,538 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-11-22 23:24:40,540 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-11-22 23:24:40,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:40,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:24:40,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:24:40,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-22 23:24:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 23:24:40,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:24:40,591 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-11-22 23:24:40,594 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-11-22 23:24:40,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:40,608 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 23:24:40,609 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 23:24:40,609 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-11-22 23:24:40,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:40,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:24:40,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:24:40,616 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-11-22 23:24:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 23:24:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:24:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 10 [2018-11-22 23:24:40,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:24:40,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:24:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:24:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-22 23:24:40,638 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2018-11-22 23:24:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:24:40,672 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-22 23:24:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:24:40,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-22 23:24:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:24:40,673 INFO L225 Difference]: With dead ends: 33 [2018-11-22 23:24:40,673 INFO L226 Difference]: Without dead ends: 25 [2018-11-22 23:24:40,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-22 23:24:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-22 23:24:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-22 23:24:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 23:24:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-22 23:24:40,677 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-22 23:24:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:24:40,677 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-22 23:24:40,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:24:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-22 23:24:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 23:24:40,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:24:40,677 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-11-22 23:24:40,678 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:24:40,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash -413303094, now seen corresponding path program 1 times [2018-11-22 23:24:40,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:24:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:40,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:24:40,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:40,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:24:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 23:24:40,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:40,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:24:40,723 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-22 23:24:40,724 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [21], [24], [29], [32], [34], [39], [42], [52], [55], [56], [57], [58], [59], [61], [62] [2018-11-22 23:24:40,725 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:24:40,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:24:40,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:24:40,771 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-11-22 23:24:40,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:40,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:24:40,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:40,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/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-11-22 23:24:40,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:40,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:24:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:40,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:24:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 23:24:40,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:24:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 23:24:40,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:24:40,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-22 23:24:40,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:24:40,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:24:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:24:40,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 23:24:40,869 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2018-11-22 23:24:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:24:40,886 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-22 23:24:40,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:24:40,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-22 23:24:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:24:40,887 INFO L225 Difference]: With dead ends: 42 [2018-11-22 23:24:40,887 INFO L226 Difference]: Without dead ends: 28 [2018-11-22 23:24:40,887 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-11-22 23:24:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-22 23:24:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-22 23:24:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 23:24:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-22 23:24:40,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-11-22 23:24:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:24:40,890 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-22 23:24:40,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:24:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-22 23:24:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 23:24:40,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:24:40,891 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-11-22 23:24:40,891 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:24:40,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 2 times [2018-11-22 23:24:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:24:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:40,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:24:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 23:24:40,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:40,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:24:40,938 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:24:40,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:24:40,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:40,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/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-11-22 23:24:40,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:24:40,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:24:40,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-22 23:24:40,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:24:40,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:24:41,034 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-11-22 23:24:41,036 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-11-22 23:24:41,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-22 23:24:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 23:24:41,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:24:41,081 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-11-22 23:24:41,085 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 23:24:41,085 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 23:24:41,086 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-11-22 23:24:41,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,094 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-11-22 23:24:41,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:24:41,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:24:41,104 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-11-22 23:24:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 23:24:41,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:24:41,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-11-22 23:24:41,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:24:41,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 23:24:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 23:24:41,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:24:41,128 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2018-11-22 23:24:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:24:41,210 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-22 23:24:41,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 23:24:41,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-22 23:24:41,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:24:41,211 INFO L225 Difference]: With dead ends: 46 [2018-11-22 23:24:41,211 INFO L226 Difference]: Without dead ends: 32 [2018-11-22 23:24:41,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-22 23:24:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-22 23:24:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-22 23:24:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-22 23:24:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-22 23:24:41,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2018-11-22 23:24:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:24:41,214 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-22 23:24:41,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 23:24:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-22 23:24:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 23:24:41,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:24:41,215 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-11-22 23:24:41,215 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:24:41,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:41,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1042968311, now seen corresponding path program 3 times [2018-11-22 23:24:41,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:24:41,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:41,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:24:41,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:41,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:24:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 23:24:41,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:41,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:24:41,277 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:24:41,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:24:41,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:41,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/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-11-22 23:24:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:24:41,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 23:24:41,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:24:41,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:24:41,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:24:41,361 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-11-22 23:24:41,363 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-11-22 23:24:41,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-22 23:24:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 23:24:41,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:24:41,495 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-11-22 23:24:41,499 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-11-22 23:24:41,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,512 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 23:24:41,513 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 23:24:41,514 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-11-22 23:24:41,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:24:41,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:24:41,520 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-11-22 23:24:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 23:24:41,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:24:41,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-22 23:24:41,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:24:41,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 23:24:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 23:24:41,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-22 23:24:41,543 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-11-22 23:24:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:24:41,616 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-22 23:24:41,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-22 23:24:41,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-22 23:24:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:24:41,617 INFO L225 Difference]: With dead ends: 52 [2018-11-22 23:24:41,617 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 23:24:41,618 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-11-22 23:24:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 23:24:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-22 23:24:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-22 23:24:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-22 23:24:41,622 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-11-22 23:24:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:24:41,622 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-22 23:24:41,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 23:24:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-22 23:24:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-22 23:24:41,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:24:41,623 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-11-22 23:24:41,623 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:24:41,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:41,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1283972954, now seen corresponding path program 4 times [2018-11-22 23:24:41,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:24:41,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:41,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:24:41,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:41,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:24:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 23:24:41,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:41,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:24:41,684 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:24:41,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:24:41,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:41,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/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-11-22 23:24:41,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:41,690 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:24:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:41,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:24:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 23:24:41,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:24:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 23:24:41,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:24:41,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-22 23:24:41,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:24:41,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 23:24:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 23:24:41,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:24:41,778 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 9 states. [2018-11-22 23:24:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:24:41,805 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-22 23:24:41,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:24:41,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-22 23:24:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:24:41,806 INFO L225 Difference]: With dead ends: 56 [2018-11-22 23:24:41,806 INFO L226 Difference]: Without dead ends: 38 [2018-11-22 23:24:41,806 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-11-22 23:24:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-22 23:24:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-22 23:24:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-22 23:24:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-22 23:24:41,811 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-11-22 23:24:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:24:41,812 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-22 23:24:41,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 23:24:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-22 23:24:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 23:24:41,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:24:41,813 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-11-22 23:24:41,813 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:24:41,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:24:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1797098632, now seen corresponding path program 5 times [2018-11-22 23:24:41,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:24:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:41,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:24:41,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:24:41,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:24:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:24:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 23:24:41,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:41,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:24:41,878 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:24:41,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:24:41,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:24:41,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/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-11-22 23:24:41,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:24:41,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:24:41,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 23:24:41,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:24:41,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:24:41,947 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-11-22 23:24:41,949 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-11-22 23:24:41,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,964 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-11-22 23:24:41,966 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-11-22 23:24:41,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:24:41,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:20 [2018-11-22 23:24:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-22 23:24:42,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:24:42,180 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-11-22 23:24:42,182 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 23:24:42,182 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 23:24:42,183 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-11-22 23:24:42,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:42,188 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-11-22 23:24:42,189 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 23:24:42,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:24:42,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:24:42,199 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:17 [2018-11-22 23:24:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-22 23:24:42,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:24:42,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2018-11-22 23:24:42,238 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:24:42,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 23:24:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 23:24:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-11-22 23:24:42,239 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-11-22 23:24:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:24:42,487 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-22 23:24:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 23:24:42,488 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-22 23:24:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:24:42,488 INFO L225 Difference]: With dead ends: 56 [2018-11-22 23:24:42,488 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 23:24:42,489 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-11-22 23:24:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 23:24:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 23:24:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 23:24:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 23:24:42,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-22 23:24:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:24:42,489 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:24:42,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 23:24:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 23:24:42,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 23:24:42,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 23:24:42,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 23:24:42,556 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-22 23:24:42,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:24:42,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:24:42,556 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 23:24:42,556 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 23:24:42,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 23:24:42,556 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-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2018-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2018-11-22 23:24:42,557 INFO L444 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (= |main_~#cont~0.offset| 0) [2018-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2018-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2018-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2018-11-22 23:24:42,557 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: true [2018-11-22 23:24:42,557 INFO L444 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2018-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2018-11-22 23:24:42,557 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 43) no Hoare annotation was computed. [2018-11-22 23:24:42,558 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-11-22 23:24:42,558 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2018-11-22 23:24:42,558 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2018-11-22 23:24:42,558 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2018-11-22 23:24:42,562 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-22 23:24:42,563 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-22 23:24:42,564 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-22 23:24:42,564 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 23:24:42,564 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-22 23:24:42,566 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-22 23:24:42,566 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-22 23:24:42,566 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-22 23:24:42,566 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 23:24:42,566 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-22 23:24:42,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:24:42 BoogieIcfgContainer [2018-11-22 23:24:42,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:24:42,569 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:24:42,569 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:24:42,569 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:24:42,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:24:39" (3/4) ... [2018-11-22 23:24:42,571 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 23:24:42,574 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 23:24:42,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 23:24:42,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-22 23:24:42,578 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-22 23:24:42,578 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-22 23:24:42,578 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-22 23:24:42,609 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9caf319e-de33-433a-aaae-8de48d30120a/bin-2019/utaipan/witness.graphml [2018-11-22 23:24:42,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:24:42,610 INFO L168 Benchmark]: Toolchain (without parser) took 3391.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -53.9 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:24:42,611 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:24:42,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.64 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:24:42,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -206.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-22 23:24:42,612 INFO L168 Benchmark]: Boogie Preprocessor took 25.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:24:42,613 INFO L168 Benchmark]: RCFGBuilder took 231.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:24:42,613 INFO L168 Benchmark]: TraceAbstraction took 2885.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 116.0 MB). Peak memory consumption was 183.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:24:42,613 INFO L168 Benchmark]: Witness Printer took 41.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:24:42,615 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.64 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -206.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 231.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2885.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 116.0 MB). Peak memory consumption was 183.6 MB. Max. memory is 11.5 GB. * Witness Printer took 41.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 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-11-22 23:24:42,619 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-22 23:24:42,619 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-22 23:24:42,619 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-22 23:24:42,619 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 23:24:42,619 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-22 23:24:42,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-22 23:24:42,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-22 23:24:42,620 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-22 23:24:42,620 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 23:24:42,621 WARN L1272 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.8s 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.8s 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.2s SatisfiabilityAnalysisTime, 1.2s 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...