./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/ldv-regression/test24_true-unreach-call_true-termination.c -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 043660dc5a969bbd34b12cbb93ba3e467b4f8613 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:08:12,926 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:08:12,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:08:12,941 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:08:12,941 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:08:12,942 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:08:12,944 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:08:12,946 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:08:12,947 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:08:12,948 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:08:12,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:08:12,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:08:12,953 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:08:12,954 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:08:12,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:08:12,961 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:08:12,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:08:12,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:08:12,972 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:08:12,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:08:12,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:08:12,981 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:08:12,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:08:12,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:08:12,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:08:12,988 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:08:12,989 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:08:12,993 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:08:12,995 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:08:12,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:08:12,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:08:12,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:08:12,999 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:08:13,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:08:13,001 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:08:13,002 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:08:13,002 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:08:13,027 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:08:13,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:08:13,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:08:13,029 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:08:13,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:08:13,031 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:08:13,031 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:08:13,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:08:13,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:08:13,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:08:13,032 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:08:13,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:08:13,032 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:08:13,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:08:13,033 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:08:13,033 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:08:13,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:08:13,033 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:08:13,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:08:13,034 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:08:13,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:08:13,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:08:13,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:08:13,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:08:13,037 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:08:13,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:08:13,038 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:08:13,038 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:08:13,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:08:13,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:08:13,039 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 -> 043660dc5a969bbd34b12cbb93ba3e467b4f8613 [2018-11-28 18:08:13,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:08:13,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:08:13,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:08:13,108 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:08:13,108 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:08:13,109 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c [2018-11-28 18:08:13,175 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f11060cd/9fa321ae54d04b06a6c706409a419376/FLAGf77c03c72 [2018-11-28 18:08:13,583 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:08:13,584 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c [2018-11-28 18:08:13,590 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f11060cd/9fa321ae54d04b06a6c706409a419376/FLAGf77c03c72 [2018-11-28 18:08:13,951 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f11060cd/9fa321ae54d04b06a6c706409a419376 [2018-11-28 18:08:13,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:08:13,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:08:13,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:13,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:08:13,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:08:13,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:13" (1/1) ... [2018-11-28 18:08:13,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ce4eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:13, skipping insertion in model container [2018-11-28 18:08:13,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:13" (1/1) ... [2018-11-28 18:08:13,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:08:13,998 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:08:14,226 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:14,238 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:08:14,262 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:14,285 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:08:14,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14 WrapperNode [2018-11-28 18:08:14,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:14,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:14,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:08:14,288 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:08:14,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (1/1) ... [2018-11-28 18:08:14,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (1/1) ... [2018-11-28 18:08:14,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:14,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:08:14,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:08:14,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:08:14,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (1/1) ... [2018-11-28 18:08:14,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (1/1) ... [2018-11-28 18:08:14,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (1/1) ... [2018-11-28 18:08:14,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (1/1) ... [2018-11-28 18:08:14,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (1/1) ... [2018-11-28 18:08:14,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (1/1) ... [2018-11-28 18:08:14,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (1/1) ... [2018-11-28 18:08:14,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:08:14,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:08:14,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:08:14,366 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:08:14,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (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 [2018-11-28 18:08:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:08:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:08:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:08:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:08:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:08:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:08:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:08:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:08:14,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:08:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-28 18:08:14,516 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-28 18:08:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:08:14,945 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:08:14,946 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 18:08:14,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:14 BoogieIcfgContainer [2018-11-28 18:08:14,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:08:14,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:08:14,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:08:14,952 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:08:14,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:08:13" (1/3) ... [2018-11-28 18:08:14,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c91767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:08:14, skipping insertion in model container [2018-11-28 18:08:14,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:14" (2/3) ... [2018-11-28 18:08:14,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c91767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:08:14, skipping insertion in model container [2018-11-28 18:08:14,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:14" (3/3) ... [2018-11-28 18:08:14,957 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_true-unreach-call_true-termination.c [2018-11-28 18:08:14,967 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:08:14,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:08:14,994 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:08:15,027 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:08:15,028 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:08:15,028 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:08:15,028 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:08:15,029 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:08:15,029 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:08:15,029 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:08:15,029 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:08:15,030 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:08:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-28 18:08:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 18:08:15,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:15,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:15,059 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:15,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:15,066 INFO L82 PathProgramCache]: Analyzing trace with hash 149844724, now seen corresponding path program 1 times [2018-11-28 18:08:15,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:15,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:15,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:15,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:15,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:15,229 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-28 18:08:15,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:15,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:08:15,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:08:15,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:08:15,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:08:15,256 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-28 18:08:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:15,274 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-28 18:08:15,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:08:15,275 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-28 18:08:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:15,284 INFO L225 Difference]: With dead ends: 35 [2018-11-28 18:08:15,284 INFO L226 Difference]: Without dead ends: 17 [2018-11-28 18:08:15,288 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-28 18:08:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-28 18:08:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 18:08:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 18:08:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-28 18:08:15,328 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-28 18:08:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:15,329 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-28 18:08:15,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:08:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-28 18:08:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 18:08:15,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:15,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:15,330 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:15,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1249419983, now seen corresponding path program 1 times [2018-11-28 18:08:15,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:15,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:15,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:15,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:15,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:15,502 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-28 18:08:15,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:15,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:15,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:15,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:15,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:15,506 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 4 states. [2018-11-28 18:08:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:15,620 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-28 18:08:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:15,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-28 18:08:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:15,622 INFO L225 Difference]: With dead ends: 27 [2018-11-28 18:08:15,622 INFO L226 Difference]: Without dead ends: 19 [2018-11-28 18:08:15,623 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 [2018-11-28 18:08:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-28 18:08:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-28 18:08:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 18:08:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-28 18:08:15,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-28 18:08:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:15,629 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-28 18:08:15,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-28 18:08:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 18:08:15,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:15,631 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:15,631 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:15,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1840889772, now seen corresponding path program 1 times [2018-11-28 18:08:15,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:15,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:15,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:15,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:15,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:15,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:15,873 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 [2018-11-28 18:08:15,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:15,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:16,000 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-28 18:08:16,004 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-28 18:08:16,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:16,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:16,014 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-28 18:08:16,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-28 18:08:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:16,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:16,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-11-28 18:08:16,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:08:16,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:08:16,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:08:16,040 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-11-28 18:08:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:16,308 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-28 18:08:16,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:08:16,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 18:08:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:16,311 INFO L225 Difference]: With dead ends: 29 [2018-11-28 18:08:16,311 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 18:08:16,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:08:16,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 18:08:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 18:08:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:08:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-28 18:08:16,317 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-28 18:08:16,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:16,317 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-28 18:08:16,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:08:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-28 18:08:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:08:16,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:16,319 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:16,319 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:16,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:16,320 INFO L82 PathProgramCache]: Analyzing trace with hash -488804505, now seen corresponding path program 2 times [2018-11-28 18:08:16,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:16,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:16,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:16,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:16,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:16,515 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 [2018-11-28 18:08:16,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:08:16,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:08:16,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:16,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:16,640 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-28 18:08:16,644 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-28 18:08:16,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:16,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:16,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:16,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-11-28 18:08:16,851 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-28 18:08:16,866 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-28 18:08:16,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:16,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:16,897 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-28 18:08:16,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-28 18:08:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:16,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:16,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 18:08:16,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:08:16,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:08:16,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:08:16,945 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 10 states. [2018-11-28 18:08:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:17,249 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-28 18:08:17,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 18:08:17,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-28 18:08:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:17,252 INFO L225 Difference]: With dead ends: 37 [2018-11-28 18:08:17,252 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 18:08:17,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:08:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 18:08:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-28 18:08:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 18:08:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-28 18:08:17,259 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 20 [2018-11-28 18:08:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:17,260 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-28 18:08:17,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:08:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-28 18:08:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:08:17,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:17,261 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:17,262 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:17,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 57078483, now seen corresponding path program 3 times [2018-11-28 18:08:17,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:17,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:17,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:17,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:08:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:17,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:17,820 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 [2018-11-28 18:08:17,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:08:17,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 18:08:17,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:08:17,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:17,879 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-28 18:08:17,887 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-28 18:08:17,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:17,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:17,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:17,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-11-28 18:08:20,499 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#ad1~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_16 Int) (|v_main_~#ad1~0.offset_BEFORE_CALL_1| Int)) (= v_main_~i~0_16 (select (select |c_#memory_int| |v_main_~#ad1~0.base_BEFORE_CALL_1|) (+ (* 8 v_main_~i~0_16) |v_main_~#ad1~0.offset_BEFORE_CALL_1|)))) is different from true [2018-11-28 18:08:26,705 WARN L180 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 18:08:32,809 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 18:08:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 18:08:32,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:32,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-11-28 18:08:32,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 18:08:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 18:08:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=249, Unknown=2, NotChecked=32, Total=342 [2018-11-28 18:08:32,876 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 19 states. [2018-11-28 18:08:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:34,038 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-28 18:08:34,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 18:08:34,039 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-11-28 18:08:34,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:34,040 INFO L225 Difference]: With dead ends: 37 [2018-11-28 18:08:34,041 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:08:34,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=287, Invalid=905, Unknown=2, NotChecked=66, Total=1260 [2018-11-28 18:08:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:08:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:08:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:08:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:08:34,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-28 18:08:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:34,044 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:08:34,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 18:08:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:08:34,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:08:34,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:08:36,241 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2018-11-28 18:08:36,248 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:08:36,248 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:08:36,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:08:36,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:08:36,249 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:08:36,250 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:08:36,250 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:08:36,250 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-28 18:08:36,250 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 31) no Hoare annotation was computed. [2018-11-28 18:08:36,250 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 38) no Hoare annotation was computed. [2018-11-28 18:08:36,250 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2018-11-28 18:08:36,251 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 32) no Hoare annotation was computed. [2018-11-28 18:08:36,251 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 32) no Hoare annotation was computed. [2018-11-28 18:08:36,251 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 38) no Hoare annotation was computed. [2018-11-28 18:08:36,251 INFO L444 ceAbstractionStarter]: At program point L30(lines 15 38) the Hoare annotation is: false [2018-11-28 18:08:36,251 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 38) the Hoare annotation is: true [2018-11-28 18:08:36,251 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2018-11-28 18:08:36,251 INFO L444 ceAbstractionStarter]: At program point L26-3(lines 26 28) the Hoare annotation is: (and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (let ((.cse0 (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) .cse0)) (= .cse0 main_~pa~0.offset))))) [2018-11-28 18:08:36,255 INFO L444 ceAbstractionStarter]: At program point L26-4(lines 26 28) the Hoare annotation is: (and (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.base |main_~#ad1~0.base|) (exists ((v_main_~i~0_16 Int)) (let ((.cse0 (select (select |#memory_int| |main_~#ad1~0.base|) (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|)))) (and (<= .cse0 main_~i~0) (<= main_~i~0 .cse0) (= v_main_~i~0_16 .cse0)))) (exists ((v_main_~i~0_16 Int)) (let ((.cse1 (+ (* 8 v_main_~i~0_16) |main_~#ad1~0.offset|))) (and (= v_main_~i~0_16 (select (select |#memory_int| main_~pa~0.base) .cse1)) (= .cse1 main_~pa~0.offset))))) [2018-11-28 18:08:36,255 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 9 12) the Hoare annotation is: true [2018-11-28 18:08:36,255 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 9 12) no Hoare annotation was computed. [2018-11-28 18:08:36,255 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 9 12) no Hoare annotation was computed. [2018-11-28 18:08:36,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,272 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:08:36,272 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:08:36,277 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,277 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:08:36,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:08:36,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:08:36 BoogieIcfgContainer [2018-11-28 18:08:36,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:08:36,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:08:36,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:08:36,282 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:08:36,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:14" (3/4) ... [2018-11-28 18:08:36,287 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:08:36,293 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:08:36,293 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:08:36,294 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-28 18:08:36,298 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-28 18:08:36,298 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 18:08:36,298 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:08:36,298 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:08:36,324 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (i <= unknown-#memory_int-unknown[pa][pa] && pa == ad1) && (\exists v_main_~i~0_16 : int :: v_main_~i~0_16 == unknown-#memory_int-unknown[pa][8 * v_main_~i~0_16 + ad1] && 8 * v_main_~i~0_16 + ad1 == pa) [2018-11-28 18:08:36,348 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:08:36,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:08:36,349 INFO L168 Benchmark]: Toolchain (without parser) took 22392.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 951.3 MB in the beginning and 804.5 MB in the end (delta: 146.8 MB). Peak memory consumption was 274.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:36,350 INFO L168 Benchmark]: CDTParser took 0.46 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. [2018-11-28 18:08:36,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.94 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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. [2018-11-28 18:08:36,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.43 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. [2018-11-28 18:08:36,352 INFO L168 Benchmark]: Boogie Preprocessor took 45.73 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:36,353 INFO L168 Benchmark]: RCFGBuilder took 581.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:36,353 INFO L168 Benchmark]: TraceAbstraction took 21334.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 811.3 MB in the end (delta: 291.0 MB). Peak memory consumption was 291.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:36,354 INFO L168 Benchmark]: Witness Printer took 66.59 ms. Allocated memory is still 1.2 GB. Free memory was 811.3 MB in the beginning and 804.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:36,358 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.46 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 327.94 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 31.43 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 45.73 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 581.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21334.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 811.3 MB in the end (delta: 291.0 MB). Peak memory consumption was 291.0 MB. Max. memory is 11.5 GB. * Witness Printer took 66.59 ms. Allocated memory is still 1.2 GB. Free memory was 811.3 MB in the beginning and 804.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] * 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: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant [2018-11-28 18:08:36,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:08:36,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:08:36,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_16,QUANTIFIED] [2018-11-28 18:08:36,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 18:08:36,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (i <= unknown-#memory_int-unknown[pa][pa] && pa == ad1) && (\exists v_main_~i~0_16 : int :: v_main_~i~0_16 == unknown-#memory_int-unknown[pa][8 * v_main_~i~0_16 + ad1] && 8 * v_main_~i~0_16 + ad1 == pa) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 21.2s OverallTime, 5 OverallIterations, 7 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 77 SDtfs, 30 SDslu, 196 SDs, 0 SdLazy, 152 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 8 LocationsWithAnnotation, 13 PreInvPairs, 21 NumberOfFragments, 103 HoareAnnotationTreeSize, 13 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 269 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 163 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 155 ConstructedInterpolants, 18 QuantifiedInterpolants, 22629 SizeOfPredicates, 25 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 36/100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...