./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/array-examples/standard_sentinel_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/array-examples/standard_sentinel_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4fbc36a28ccee76a98a185e0c5cc58738af3c30 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 18:26:16,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 18:26:16,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 18:26:16,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 18:26:16,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 18:26:16,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 18:26:16,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 18:26:16,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 18:26:16,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 18:26:16,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 18:26:16,217 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 18:26:16,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 18:26:16,219 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 18:26:16,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 18:26:16,221 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 18:26:16,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 18:26:16,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 18:26:16,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 18:26:16,227 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 18:26:16,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 18:26:16,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 18:26:16,231 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 18:26:16,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 18:26:16,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 18:26:16,235 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 18:26:16,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 18:26:16,238 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 18:26:16,239 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 18:26:16,239 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 18:26:16,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 18:26:16,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 18:26:16,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 18:26:16,242 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 18:26:16,242 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 18:26:16,243 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 18:26:16,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 18:26:16,245 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 18:26:16,274 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 18:26:16,276 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 18:26:16,278 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 18:26:16,279 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 18:26:16,279 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 18:26:16,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 18:26:16,279 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 18:26:16,279 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 18:26:16,280 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 18:26:16,280 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 18:26:16,280 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 18:26:16,280 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 18:26:16,280 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 18:26:16,280 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 18:26:16,281 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 18:26:16,281 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 18:26:16,281 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 18:26:16,281 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 18:26:16,281 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 18:26:16,281 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 18:26:16,282 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 18:26:16,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 18:26:16,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 18:26:16,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 18:26:16,282 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 18:26:16,283 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 18:26:16,284 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 18:26:16,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 18:26:16,284 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> b4fbc36a28ccee76a98a185e0c5cc58738af3c30 [2019-01-11 18:26:16,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 18:26:16,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 18:26:16,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 18:26:16,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 18:26:16,355 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 18:26:16,356 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-examples/standard_sentinel_true-unreach-call_true-termination.i [2019-01-11 18:26:16,429 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32bfa58a1/4e2b24df814f426880ad0cd72fa4d59b/FLAG1b8f07d5e [2019-01-11 18:26:16,874 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 18:26:16,875 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-examples/standard_sentinel_true-unreach-call_true-termination.i [2019-01-11 18:26:16,882 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32bfa58a1/4e2b24df814f426880ad0cd72fa4d59b/FLAG1b8f07d5e [2019-01-11 18:26:17,256 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32bfa58a1/4e2b24df814f426880ad0cd72fa4d59b [2019-01-11 18:26:17,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 18:26:17,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 18:26:17,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 18:26:17,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 18:26:17,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 18:26:17,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4753250b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17, skipping insertion in model container [2019-01-11 18:26:17,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 18:26:17,302 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 18:26:17,514 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 18:26:17,518 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 18:26:17,535 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 18:26:17,556 INFO L195 MainTranslator]: Completed translation [2019-01-11 18:26:17,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17 WrapperNode [2019-01-11 18:26:17,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 18:26:17,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 18:26:17,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 18:26:17,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 18:26:17,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 18:26:17,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 18:26:17,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 18:26:17,600 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 18:26:17,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... [2019-01-11 18:26:17,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 18:26:17,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 18:26:17,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 18:26:17,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 18:26:17,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-11 18:26:17,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-11 18:26:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 18:26:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 18:26:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-11 18:26:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-11 18:26:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-11 18:26:17,993 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 18:26:17,993 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 18:26:17,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:26:17 BoogieIcfgContainer [2019-01-11 18:26:17,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 18:26:17,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 18:26:17,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 18:26:18,009 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 18:26:18,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 06:26:17" (1/3) ... [2019-01-11 18:26:18,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@999f8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:26:18, skipping insertion in model container [2019-01-11 18:26:18,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:26:17" (2/3) ... [2019-01-11 18:26:18,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@999f8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:26:18, skipping insertion in model container [2019-01-11 18:26:18,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:26:17" (3/3) ... [2019-01-11 18:26:18,016 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_sentinel_true-unreach-call_true-termination.i [2019-01-11 18:26:18,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 18:26:18,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 18:26:18,082 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 18:26:18,126 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 18:26:18,127 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 18:26:18,128 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 18:26:18,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 18:26:18,128 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 18:26:18,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 18:26:18,128 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 18:26:18,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 18:26:18,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 18:26:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-11 18:26:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 18:26:18,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 18:26:18,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 18:26:18,156 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 18:26:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 18:26:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1805211654, now seen corresponding path program 1 times [2019-01-11 18:26:18,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 18:26:18,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 18:26:18,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:18,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 18:26:18,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 18:26:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 18:26:18,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 18:26:18,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 18:26:18,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-11 18:26:18,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-11 18:26:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-11 18:26:18,295 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-11 18:26:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 18:26:18,307 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-01-11 18:26:18,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-11 18:26:18,308 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-01-11 18:26:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 18:26:18,317 INFO L225 Difference]: With dead ends: 21 [2019-01-11 18:26:18,317 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 18:26:18,320 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 [2019-01-11 18:26:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 18:26:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 18:26:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 18:26:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-11 18:26:18,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-11 18:26:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 18:26:18,348 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-11 18:26:18,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-11 18:26:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-11 18:26:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 18:26:18,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 18:26:18,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 18:26:18,350 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 18:26:18,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 18:26:18,351 INFO L82 PathProgramCache]: Analyzing trace with hash 120340112, now seen corresponding path program 1 times [2019-01-11 18:26:18,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 18:26:18,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 18:26:18,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:18,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 18:26:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 18:26:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 18:26:18,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 18:26:18,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 18:26:18,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 18:26:18,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 18:26:18,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 18:26:18,479 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2019-01-11 18:26:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 18:26:18,567 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-11 18:26:18,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 18:26:18,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-11 18:26:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 18:26:18,569 INFO L225 Difference]: With dead ends: 15 [2019-01-11 18:26:18,569 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 18:26:18,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 18:26:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 18:26:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 18:26:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 18:26:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-11 18:26:18,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-11 18:26:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 18:26:18,574 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-11 18:26:18,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 18:26:18,575 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-11 18:26:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 18:26:18,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 18:26:18,576 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 18:26:18,576 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 18:26:18,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 18:26:18,576 INFO L82 PathProgramCache]: Analyzing trace with hash -268594965, now seen corresponding path program 1 times [2019-01-11 18:26:18,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 18:26:18,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 18:26:18,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:18,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 18:26:18,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 18:26:19,076 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2019-01-11 18:26:19,306 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2019-01-11 18:26:19,513 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 15 [2019-01-11 18:26:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 18:26:19,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 18:26:19,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-11 18:26:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 18:26:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 18:26:19,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 18:26:19,633 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 [2019-01-11 18:26:19,640 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 [2019-01-11 18:26:19,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 18:26:19,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 18:26:19,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-11 18:26:19,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-11 18:26:19,716 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 23 treesize of output 19 [2019-01-11 18:26:19,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2019-01-11 18:26:19,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-11 18:26:19,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 18:26:19,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 18:26:19,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-01-11 18:26:20,252 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-11 18:26:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 18:26:20,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 18:26:20,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-01-11 18:26:20,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 18:26:20,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 18:26:20,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-11 18:26:20,301 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-01-11 18:26:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 18:26:20,494 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-11 18:26:20,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 18:26:20,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-01-11 18:26:20,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 18:26:20,496 INFO L225 Difference]: With dead ends: 17 [2019-01-11 18:26:20,497 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 18:26:20,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-11 18:26:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 18:26:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-11 18:26:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 18:26:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-11 18:26:20,501 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-01-11 18:26:20,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 18:26:20,501 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-11 18:26:20,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 18:26:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-11 18:26:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 18:26:20,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 18:26:20,502 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 18:26:20,503 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 18:26:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 18:26:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash -373049210, now seen corresponding path program 2 times [2019-01-11 18:26:20,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 18:26:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 18:26:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:20,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 18:26:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 18:26:20,975 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2019-01-11 18:26:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 18:26:21,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 18:26:21,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-11 18:26:21,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-11 18:26:21,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-11 18:26:21,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 18:26:21,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 18:26:21,214 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 [2019-01-11 18:26:21,220 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 [2019-01-11 18:26:21,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 18:26:21,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 18:26:21,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-11 18:26:21,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-11 18:26:21,338 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 35 treesize of output 29 [2019-01-11 18:26:21,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 49 [2019-01-11 18:26:21,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-01-11 18:26:21,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 18:26:21,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-11 18:26:21,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:110 [2019-01-11 18:26:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 18:26:21,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 18:26:21,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-01-11 18:26:21,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 18:26:21,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 18:26:21,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-01-11 18:26:21,763 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 15 states. [2019-01-11 18:26:22,193 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-01-11 18:26:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 18:26:22,468 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-11 18:26:22,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 18:26:22,470 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2019-01-11 18:26:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 18:26:22,471 INFO L225 Difference]: With dead ends: 23 [2019-01-11 18:26:22,471 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 18:26:22,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-01-11 18:26:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 18:26:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 18:26:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 18:26:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-11 18:26:22,475 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-01-11 18:26:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 18:26:22,476 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-11 18:26:22,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 18:26:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-11 18:26:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 18:26:22,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 18:26:22,477 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 18:26:22,477 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 18:26:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 18:26:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1602307964, now seen corresponding path program 3 times [2019-01-11 18:26:22,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 18:26:22,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 18:26:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:22,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 18:26:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 18:26:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 18:26:23,099 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 26 [2019-01-11 18:26:23,418 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 27 [2019-01-11 18:26:23,542 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 24 [2019-01-11 18:26:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 18:26:23,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 18:26:23,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-11 18:26:23,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 18:26:23,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-11 18:26:23,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 18:26:23,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 18:26:23,739 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 [2019-01-11 18:26:23,742 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 [2019-01-11 18:26:23,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 18:26:23,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 18:26:23,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-11 18:26:23,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-11 18:26:23,969 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 51 treesize of output 41 [2019-01-11 18:26:23,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 18:26:23,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 18:26:23,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 18:26:24,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 117 [2019-01-11 18:26:24,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2019-01-11 18:26:24,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 18:26:24,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-11 18:26:24,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:118 [2019-01-11 18:26:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 18:26:24,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 18:26:24,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-01-11 18:26:24,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 18:26:24,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 18:26:24,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-01-11 18:26:24,362 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 22 states. [2019-01-11 18:26:25,051 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-01-11 18:26:25,174 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-01-11 18:26:25,323 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-01-11 18:26:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 18:26:25,506 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-11 18:26:25,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 18:26:25,506 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 16 [2019-01-11 18:26:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 18:26:25,507 INFO L225 Difference]: With dead ends: 21 [2019-01-11 18:26:25,507 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 18:26:25,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2019-01-11 18:26:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 18:26:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 18:26:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 18:26:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 18:26:25,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-01-11 18:26:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 18:26:25,509 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 18:26:25,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 18:26:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 18:26:25,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 18:26:25,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 18:26:25,617 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 18:26:25,618 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2019-01-11 18:26:25,618 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_main_~#a~0.offset| (* 4 ULTIMATE.start_main_~pos~0)))) (let ((.cse0 (= ULTIMATE.start_main_~marker~0 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) .cse2))) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| 0))) (or (and .cse0 (< ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~pos~0 1)) .cse1 (not (= 0 .cse2))) (and .cse0 .cse1 (<= 0 ULTIMATE.start_main_~pos~0) (= ULTIMATE.start_main_~i~0 0))))) [2019-01-11 18:26:25,618 INFO L448 ceAbstractionStarter]: For program point L11-4(lines 11 13) no Hoare annotation was computed. [2019-01-11 18:26:25,618 INFO L448 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-01-11 18:26:25,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-01-11 18:26:25,619 INFO L448 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-01-11 18:26:25,619 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-11 18:26:25,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 18:26:25,619 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 18:26:25,619 INFO L451 ceAbstractionStarter]: At program point L16(lines 4 17) the Hoare annotation is: true [2019-01-11 18:26:25,619 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 15) no Hoare annotation was computed. [2019-01-11 18:26:25,619 INFO L448 ceAbstractionStarter]: For program point L8-1(lines 8 15) no Hoare annotation was computed. [2019-01-11 18:26:25,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-11 18:26:25,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-11 18:26:25,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-11 18:26:25,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-11 18:26:25,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:26:25 BoogieIcfgContainer [2019-01-11 18:26:25,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 18:26:25,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 18:26:25,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 18:26:25,640 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 18:26:25,640 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:26:17" (3/4) ... [2019-01-11 18:26:25,643 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 18:26:25,653 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-11 18:26:25,654 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 18:26:25,654 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-11 18:26:25,699 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 18:26:25,699 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 18:26:25,700 INFO L168 Benchmark]: Toolchain (without parser) took 8438.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 951.4 MB in the beginning and 947.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 207.0 MB. Max. memory is 11.5 GB. [2019-01-11 18:26:25,701 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 18:26:25,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.36 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 18:26:25,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 18:26:25,702 INFO L168 Benchmark]: Boogie Preprocessor took 31.05 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-11 18:26:25,703 INFO L168 Benchmark]: RCFGBuilder took 363.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-11 18:26:25,704 INFO L168 Benchmark]: TraceAbstraction took 7643.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 947.7 MB in the end (delta: 159.1 MB). Peak memory consumption was 230.4 MB. Max. memory is 11.5 GB. [2019-01-11 18:26:25,704 INFO L168 Benchmark]: Witness Printer took 59.32 ms. Allocated memory is still 1.2 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 18:26:25,708 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.36 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.05 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 363.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7643.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 947.7 MB in the end (delta: 159.1 MB). Peak memory consumption was 230.4 MB. Max. memory is 11.5 GB. * Witness Printer took 59.32 ms. Allocated memory is still 1.2 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant [2019-01-11 18:26:25,716 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-11 18:26:25,716 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-11 18:26:25,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-11 18:26:25,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((marker == unknown-#memory_int-unknown[a][a + 4 * pos] && i < pos + 1) && a == 0) && !(0 == a + 4 * pos)) || (((marker == unknown-#memory_int-unknown[a][a + 4 * pos] && a == 0) && 0 <= pos) && i == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. SAFE Result, 7.5s OverallTime, 5 OverallIterations, 5 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 64 SDslu, 57 SDs, 0 SdLazy, 238 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 8 NumberOfFragments, 51 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 240 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 83 ConstructedInterpolants, 1 QuantifiedInterpolants, 15754 SizeOfPredicates, 24 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...