./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 2e94e6aa 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-2e94e6a [2018-12-31 04:23:53,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:23:53,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:23:53,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:23:53,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:23:53,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:23:53,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:23:53,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:23:53,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:23:53,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:23:53,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:23:53,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:23:53,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:23:53,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:23:53,178 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:23:53,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:23:53,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:23:53,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:23:53,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:23:53,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:23:53,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:23:53,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:23:53,193 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:23:53,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:23:53,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:23:53,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:23:53,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:23:53,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:23:53,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:23:53,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:23:53,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:23:53,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:23:53,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:23:53,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:23:53,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:23:53,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:23:53,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:23:53,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:23:53,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:23:53,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:23:53,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:23:53,221 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:23:53,221 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:23:53,221 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:23:53,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:23:53,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:23:53,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:23:53,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:23:53,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:23:53,223 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:23:53,223 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:23:53,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:23:53,224 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:23:53,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:23:53,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:23:53,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:23:53,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:23:53,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:23:53,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:23:53,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:23:53,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:23:53,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:23:53,227 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:23:53,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:23:53,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:23:53,228 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-12-31 04:23:53,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:23:53,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:23:53,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:23:53,283 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:23:53,283 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:23:53,284 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c [2018-12-31 04:23:53,343 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dccbb5ef/6c54b44140b345fe9f3904a712d2e6f5/FLAG13bf3b01d [2018-12-31 04:23:53,840 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:23:53,841 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c [2018-12-31 04:23:53,848 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dccbb5ef/6c54b44140b345fe9f3904a712d2e6f5/FLAG13bf3b01d [2018-12-31 04:23:54,224 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dccbb5ef/6c54b44140b345fe9f3904a712d2e6f5 [2018-12-31 04:23:54,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:23:54,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:23:54,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:23:54,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:23:54,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:23:54,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54008995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54, skipping insertion in model container [2018-12-31 04:23:54,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:23:54,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:23:54,467 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:23:54,480 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:23:54,507 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:23:54,538 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:23:54,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54 WrapperNode [2018-12-31 04:23:54,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:23:54,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:23:54,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:23:54,540 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:23:54,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:23:54,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:23:54,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:23:54,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:23:54,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (1/1) ... [2018-12-31 04:23:54,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:23:54,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:23:54,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:23:54,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:23:54,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (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-12-31 04:23:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:23:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:23:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:23:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:23:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:23:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:23:55,042 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:23:55,043 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-31 04:23:55,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:55 BoogieIcfgContainer [2018-12-31 04:23:55,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:23:55,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:23:55,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:23:55,048 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:23:55,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:23:54" (1/3) ... [2018-12-31 04:23:55,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5162391a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:23:55, skipping insertion in model container [2018-12-31 04:23:55,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:54" (2/3) ... [2018-12-31 04:23:55,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5162391a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:23:55, skipping insertion in model container [2018-12-31 04:23:55,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:55" (3/3) ... [2018-12-31 04:23:55,055 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_true-unreach-call_true-termination.c [2018-12-31 04:23:55,073 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:23:55,098 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:23:55,115 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:23:55,142 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:23:55,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:23:55,143 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:23:55,143 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:23:55,143 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:23:55,143 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:23:55,143 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:23:55,143 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:23:55,144 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:23:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-31 04:23:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-31 04:23:55,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:55,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:55,169 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash 126985497, now seen corresponding path program 1 times [2018-12-31 04:23:55,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:55,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:55,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:55,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:55,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:55,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:23:55,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:23:55,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:23:55,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:23:55,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:23:55,330 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-31 04:23:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:55,345 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-12-31 04:23:55,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:23:55,347 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-31 04:23:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:55,356 INFO L225 Difference]: With dead ends: 23 [2018-12-31 04:23:55,356 INFO L226 Difference]: Without dead ends: 10 [2018-12-31 04:23:55,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:23:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-31 04:23:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-31 04:23:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-31 04:23:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-31 04:23:55,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-31 04:23:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:55,398 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-31 04:23:55,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:23:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-31 04:23:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 04:23:55,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:55,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:55,399 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash -564424753, now seen corresponding path program 1 times [2018-12-31 04:23:55,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:55,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:55,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:55,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:55,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:55,702 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 3 [2018-12-31 04:23:56,136 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2018-12-31 04:23:56,369 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2018-12-31 04:23:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:56,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:23:56,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:23:56,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:23:56,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:23:56,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:23:56,385 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 5 states. [2018-12-31 04:23:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:56,592 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-31 04:23:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:23:56,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 04:23:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:56,594 INFO L225 Difference]: With dead ends: 17 [2018-12-31 04:23:56,594 INFO L226 Difference]: Without dead ends: 12 [2018-12-31 04:23:56,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:23:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-31 04:23:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-31 04:23:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-31 04:23:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-31 04:23:56,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-31 04:23:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:56,601 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-31 04:23:56,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:23:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-31 04:23:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 04:23:56,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:56,602 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:56,603 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:56,603 INFO L82 PathProgramCache]: Analyzing trace with hash 263489748, now seen corresponding path program 1 times [2018-12-31 04:23:56,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:56,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:56,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:56,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:56,816 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-12-31 04:23:56,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:56,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:56,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:23:56,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 04:23:56,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:56,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:56,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:56,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-31 04:23:57,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-31 04:23:57,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-31 04:23:57,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:57,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:57,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:57,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-31 04:23:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:57,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:57,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-12-31 04:23:57,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 04:23:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 04:23:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:23:57,077 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-12-31 04:23:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:57,384 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-31 04:23:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 04:23:57,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-31 04:23:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:57,385 INFO L225 Difference]: With dead ends: 21 [2018-12-31 04:23:57,386 INFO L226 Difference]: Without dead ends: 16 [2018-12-31 04:23:57,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:23:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-31 04:23:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-31 04:23:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-31 04:23:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-31 04:23:57,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2018-12-31 04:23:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:57,391 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-31 04:23:57,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 04:23:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-31 04:23:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:23:57,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:57,392 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:57,393 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash -919715042, now seen corresponding path program 2 times [2018-12-31 04:23:57,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:57,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:57,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:57,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:57,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:57,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:57,711 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-12-31 04:23:57,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:23:57,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:23:57,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:57,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:57,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-31 04:23:57,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-31 04:23:57,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:57,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:57,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:57,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-31 04:23:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:57,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:57,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-12-31 04:23:57,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 04:23:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 04:23:57,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:23:57,907 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-12-31 04:23:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:58,014 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-31 04:23:58,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:23:58,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-31 04:23:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:58,016 INFO L225 Difference]: With dead ends: 23 [2018-12-31 04:23:58,016 INFO L226 Difference]: Without dead ends: 18 [2018-12-31 04:23:58,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:23:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-31 04:23:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-31 04:23:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-31 04:23:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-31 04:23:58,022 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-31 04:23:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:58,023 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-31 04:23:58,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 04:23:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-31 04:23:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 04:23:58,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:58,024 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:58,024 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1868061597, now seen corresponding path program 3 times [2018-12-31 04:23:58,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:58,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:58,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:58,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:58,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:58,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:58,404 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-12-31 04:23:58,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 04:23:58,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-31 04:23:58,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:58,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:58,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-31 04:23:58,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 04:23:58,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:58,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:58,491 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-12-31 04:23:58,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-12-31 04:23:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 04:23:58,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:58,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-12-31 04:23:58,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 04:23:58,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 04:23:58,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-31 04:23:58,866 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-12-31 04:23:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:59,675 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-31 04:23:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 04:23:59,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-12-31 04:23:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:59,676 INFO L225 Difference]: With dead ends: 23 [2018-12-31 04:23:59,678 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:23:59,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-12-31 04:23:59,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:23:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:23:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:23:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:23:59,679 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-12-31 04:23:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:59,681 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:23:59,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 04:23:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:23:59,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:23:59,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:24:00,020 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2018-12-31 04:24:00,025 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:24:00,025 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-12-31 04:24:00,025 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 32) no Hoare annotation was computed. [2018-12-31 04:24:00,025 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 32) no Hoare annotation was computed. [2018-12-31 04:24:00,025 INFO L444 ceAbstractionStarter]: At program point L11(lines 9 12) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (exists ((v_ULTIMATE.start_main_~i~0_18 Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* 8 v_ULTIMATE.start_main_~i~0_18))))) (and (<= ULTIMATE.start_main_~i~0 .cse0) (<= .cse0 ULTIMATE.start_main_~i~0) (= v_ULTIMATE.start_main_~i~0_18 .cse0)))) (= |ULTIMATE.start_main_~#ad1~0.offset| 0) (exists ((v_ULTIMATE.start_main_~i~0_18 Int)) (let ((.cse1 (+ |ULTIMATE.start_main_~#ad1~0.offset| (* 8 v_ULTIMATE.start_main_~i~0_18)))) (and (= ULTIMATE.start_main_~pa~0.offset .cse1) (= (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse1) v_ULTIMATE.start_main_~i~0_18)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|) (= 1 |ULTIMATE.start_check_#res|)) [2018-12-31 04:24:00,026 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:24:00,026 INFO L444 ceAbstractionStarter]: At program point L30(lines 15 38) the Hoare annotation is: false [2018-12-31 04:24:00,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:24:00,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:24:00,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2018-12-31 04:24:00,026 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2018-12-31 04:24:00,026 INFO L444 ceAbstractionStarter]: At program point L26-3(lines 26 28) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= |ULTIMATE.start_main_~#ad1~0.offset| 0) (exists ((v_ULTIMATE.start_main_~i~0_18 Int)) (let ((.cse0 (+ |ULTIMATE.start_main_~#ad1~0.offset| (* 8 v_ULTIMATE.start_main_~i~0_18)))) (and (= ULTIMATE.start_main_~pa~0.offset .cse0) (= (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse0) v_ULTIMATE.start_main_~i~0_18)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|)) [2018-12-31 04:24:00,026 INFO L448 ceAbstractionStarter]: For program point L26-4(lines 26 28) no Hoare annotation was computed. [2018-12-31 04:24:00,027 INFO L451 ceAbstractionStarter]: At program point L37(lines 14 38) the Hoare annotation is: true [2018-12-31 04:24:00,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:24:00 BoogieIcfgContainer [2018-12-31 04:24:00,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:24:00,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:24:00,061 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:24:00,061 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:24:00,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:55" (3/4) ... [2018-12-31 04:24:00,066 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 04:24:00,078 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-31 04:24:00,079 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 04:24:00,079 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 04:24:00,105 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((i <= unknown-#memory_int-unknown[pa][pa] && ad1 == 0) && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: pa == ad1 + 8 * v_ULTIMATE.start_main_~i~0_18 && unknown-#memory_int-unknown[pa][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] == v_ULTIMATE.start_main_~i~0_18)) && pa == ad1 [2018-12-31 04:24:00,105 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((i <= unknown-#memory_int-unknown[pa][pa] && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: (i <= unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] && unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] <= i) && v_ULTIMATE.start_main_~i~0_18 == unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18])) && ad1 == 0) && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: pa == ad1 + 8 * v_ULTIMATE.start_main_~i~0_18 && unknown-#memory_int-unknown[pa][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] == v_ULTIMATE.start_main_~i~0_18)) && pa == ad1) && 1 == \result [2018-12-31 04:24:00,130 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:24:00,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:24:00,131 INFO L168 Benchmark]: Toolchain (without parser) took 5902.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.0 MB in the beginning and 843.9 MB in the end (delta: 102.1 MB). Peak memory consumption was 233.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:00,132 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:24:00,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.31 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:00,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.29 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:24:00,135 INFO L168 Benchmark]: Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:00,136 INFO L168 Benchmark]: RCFGBuilder took 439.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:00,138 INFO L168 Benchmark]: TraceAbstraction took 5015.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 850.6 MB in the end (delta: 256.6 MB). Peak memory consumption was 256.6 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:00,139 INFO L168 Benchmark]: Witness Printer took 69.64 ms. Allocated memory is still 1.2 GB. Free memory was 850.6 MB in the beginning and 843.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:24:00,144 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.31 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 38.29 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 439.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5015.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 850.6 MB in the end (delta: 256.6 MB). Peak memory consumption was 256.6 MB. Max. memory is 11.5 GB. * Witness Printer took 69.64 ms. Allocated memory is still 1.2 GB. Free memory was 850.6 MB in the beginning and 843.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 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_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,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 - 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 - 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 - 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: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9]: Loop Invariant [2018-12-31 04:24:00,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((i <= unknown-#memory_int-unknown[pa][pa] && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: (i <= unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] && unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] <= i) && v_ULTIMATE.start_main_~i~0_18 == unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18])) && ad1 == 0) && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: pa == ad1 + 8 * v_ULTIMATE.start_main_~i~0_18 && unknown-#memory_int-unknown[pa][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] == v_ULTIMATE.start_main_~i~0_18)) && pa == ad1) && 1 == \result - InvariantResult [Line: 26]: Loop Invariant [2018-12-31 04:24:00,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2018-12-31 04:24:00,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:24:00,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((i <= unknown-#memory_int-unknown[pa][pa] && ad1 == 0) && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: pa == ad1 + 8 * v_ULTIMATE.start_main_~i~0_18 && unknown-#memory_int-unknown[pa][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] == v_ULTIMATE.start_main_~i~0_18)) && pa == ad1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 5 OverallIterations, 5 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 SDtfs, 38 SDslu, 38 SDs, 0 SdLazy, 116 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 108 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 221 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 103 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 95 ConstructedInterpolants, 11 QuantifiedInterpolants, 10041 SizeOfPredicates, 29 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 16/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...