./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-sets/test_add_true-unreach-call_true-termination.i --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-sets/test_add_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c69389479aaa51869578ea93cca3b02df528e19e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:54:26,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:54:26,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:54:26,191 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:54:26,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:54:26,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:54:26,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:54:26,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:54:26,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:54:26,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:54:26,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:54:26,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:54:26,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:54:26,203 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:54:26,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:54:26,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:54:26,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:54:26,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:54:26,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:54:26,212 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:54:26,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:54:26,215 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:54:26,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:54:26,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:54:26,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:54:26,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:54:26,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:54:26,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:54:26,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:54:26,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:54:26,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:54:26,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:54:26,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:54:26,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:54:26,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:54:26,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:54:26,229 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:54:26,245 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:54:26,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:54:26,246 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:54:26,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:54:26,247 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:54:26,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:54:26,248 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:54:26,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:54:26,248 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:54:26,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:54:26,248 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:54:26,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:54:26,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:54:26,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:54:26,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:54:26,249 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:54:26,249 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:54:26,251 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:54:26,251 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:54:26,251 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:54:26,252 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:54:26,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:54:26,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:54:26,252 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:54:26,252 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:54:26,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:54:26,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:54:26,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:54:26,254 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 -> c69389479aaa51869578ea93cca3b02df528e19e [2018-12-31 04:54:26,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:54:26,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:54:26,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:54:26,312 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:54:26,313 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:54:26,313 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-sets/test_add_true-unreach-call_true-termination.i [2018-12-31 04:54:26,374 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4be543e9/621acd757f314bb6a8e6ee65dee38e3b/FLAGb237a0ffe [2018-12-31 04:54:26,858 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:54:26,859 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-sets/test_add_true-unreach-call_true-termination.i [2018-12-31 04:54:26,878 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4be543e9/621acd757f314bb6a8e6ee65dee38e3b/FLAGb237a0ffe [2018-12-31 04:54:27,162 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4be543e9/621acd757f314bb6a8e6ee65dee38e3b [2018-12-31 04:54:27,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:54:27,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:54:27,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:54:27,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:54:27,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:54:27,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:54:27" (1/1) ... [2018-12-31 04:54:27,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3994644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27, skipping insertion in model container [2018-12-31 04:54:27,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:54:27" (1/1) ... [2018-12-31 04:54:27,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:54:27,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:54:27,639 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:54:27,652 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:54:27,821 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:54:27,883 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:54:27,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27 WrapperNode [2018-12-31 04:54:27,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:54:27,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:54:27,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:54:27,886 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:54:27,896 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:54:27" (1/1) ... [2018-12-31 04:54:27,921 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:54:27" (1/1) ... [2018-12-31 04:54:27,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:54:27,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:54:27,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:54:27,961 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:54:27,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27" (1/1) ... [2018-12-31 04:54:27,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27" (1/1) ... [2018-12-31 04:54:27,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27" (1/1) ... [2018-12-31 04:54:27,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27" (1/1) ... [2018-12-31 04:54:27,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27" (1/1) ... [2018-12-31 04:54:27,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27" (1/1) ... [2018-12-31 04:54:27,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27" (1/1) ... [2018-12-31 04:54:27,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:54:27,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:54:27,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:54:27,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:54:27,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27" (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:54:28,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:54:28,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:54:28,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 04:54:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 04:54:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:54:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 04:54:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-31 04:54:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:54:28,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:54:28,629 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:54:28,630 INFO L280 CfgBuilder]: Removed 20 assue(true) statements. [2018-12-31 04:54:28,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:54:28 BoogieIcfgContainer [2018-12-31 04:54:28,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:54:28,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:54:28,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:54:28,636 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:54:28,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:54:27" (1/3) ... [2018-12-31 04:54:28,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cfe5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:54:28, skipping insertion in model container [2018-12-31 04:54:28,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:54:27" (2/3) ... [2018-12-31 04:54:28,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cfe5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:54:28, skipping insertion in model container [2018-12-31 04:54:28,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:54:28" (3/3) ... [2018-12-31 04:54:28,641 INFO L112 eAbstractionObserver]: Analyzing ICFG test_add_true-unreach-call_true-termination.i [2018-12-31 04:54:28,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:54:28,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:54:28,678 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:54:28,708 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:54:28,709 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:54:28,709 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:54:28,709 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:54:28,709 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:54:28,709 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:54:28,710 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:54:28,710 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:54:28,710 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:54:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-31 04:54:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 04:54:28,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:54:28,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:54:28,734 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:54:28,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:54:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash -923442845, now seen corresponding path program 1 times [2018-12-31 04:54:28,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:54:28,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:54:28,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:28,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:54:28,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:54:28,892 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:54:28,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:54:28,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:54:28,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:54:28,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:54:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:54:28,913 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-12-31 04:54:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:54:28,928 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-12-31 04:54:28,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:54:28,930 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-12-31 04:54:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:54:28,941 INFO L225 Difference]: With dead ends: 41 [2018-12-31 04:54:28,941 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 04:54:28,945 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:54:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 04:54:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-31 04:54:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 04:54:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-31 04:54:28,983 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2018-12-31 04:54:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:54:28,983 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-31 04:54:28,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:54:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-12-31 04:54:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 04:54:28,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:54:28,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:54:28,985 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:54:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:54:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1228046979, now seen corresponding path program 1 times [2018-12-31 04:54:28,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:54:28,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:54:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:28,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:54:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:54:29,246 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:54:29,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:54:29,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:54:29,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:54:29,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:54:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:54:29,252 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2018-12-31 04:54:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:54:29,517 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-31 04:54:29,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:54:29,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 04:54:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:54:29,520 INFO L225 Difference]: With dead ends: 37 [2018-12-31 04:54:29,520 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 04:54:29,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:54:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 04:54:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-12-31 04:54:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 04:54:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-31 04:54:29,527 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2018-12-31 04:54:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:54:29,528 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-31 04:54:29,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:54:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-31 04:54:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 04:54:29,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:54:29,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:54:29,529 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:54:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:54:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1885213511, now seen corresponding path program 1 times [2018-12-31 04:54:29,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:54:29,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:54:29,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:29,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:54:29,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:54:29,992 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 17 [2018-12-31 04:54:30,009 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:54:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:54:30,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:54:30,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:54:30,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:54:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:54:30,011 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2018-12-31 04:54:30,207 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-31 04:54:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:54:30,278 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-12-31 04:54:30,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:54:30,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 04:54:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:54:30,280 INFO L225 Difference]: With dead ends: 36 [2018-12-31 04:54:30,280 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 04:54:30,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:54:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 04:54:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 04:54:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 04:54:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-31 04:54:30,287 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2018-12-31 04:54:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:54:30,287 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-31 04:54:30,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:54:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-31 04:54:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:54:30,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:54:30,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:54:30,289 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:54:30,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:54:30,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2054053118, now seen corresponding path program 1 times [2018-12-31 04:54:30,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:54:30,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:54:30,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:30,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:54:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:54:30,468 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:54:30,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:54:30,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:54:30,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:54:30,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:54:30,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:54:30,470 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-12-31 04:54:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:54:30,744 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-12-31 04:54:30,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 04:54:30,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-31 04:54:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:54:30,747 INFO L225 Difference]: With dead ends: 29 [2018-12-31 04:54:30,747 INFO L226 Difference]: Without dead ends: 24 [2018-12-31 04:54:30,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:54:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-31 04:54:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-12-31 04:54:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-31 04:54:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-31 04:54:30,753 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2018-12-31 04:54:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:54:30,754 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-31 04:54:30,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:54:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-31 04:54:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:54:30,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:54:30,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:54:30,755 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:54:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:54:30,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2055661832, now seen corresponding path program 1 times [2018-12-31 04:54:30,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:54:30,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:54:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:30,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:54:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:54:30,830 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:54:30,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:54:30,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:54:30,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:54:30,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:54:30,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:54:30,831 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2018-12-31 04:54:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:54:30,885 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-31 04:54:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:54:30,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 04:54:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:54:30,887 INFO L225 Difference]: With dead ends: 22 [2018-12-31 04:54:30,887 INFO L226 Difference]: Without dead ends: 18 [2018-12-31 04:54:30,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:54:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-31 04:54:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-31 04:54:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-31 04:54:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-31 04:54:30,895 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-12-31 04:54:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:54:30,895 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-31 04:54:30,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:54:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-31 04:54:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 04:54:30,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:54:30,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:54:30,898 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:54:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:54:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash -130550515, now seen corresponding path program 1 times [2018-12-31 04:54:30,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:54:30,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:54:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:30,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:54:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:54:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:54:31,434 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-12-31 04:54:31,690 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-12-31 04:54:31,831 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-12-31 04:54:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:54:31,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:54:31,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:54:31,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:54:31,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:54:31,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:54:31,866 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 8 states. [2018-12-31 04:54:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:54:32,116 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-31 04:54:32,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 04:54:32,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-31 04:54:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:54:32,117 INFO L225 Difference]: With dead ends: 19 [2018-12-31 04:54:32,117 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:54:32,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:54:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:54:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:54:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:54:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:54:32,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-12-31 04:54:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:54:32,120 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:54:32,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:54:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:54:32,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:54:32,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:54:32,322 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-12-31 04:54:32,530 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-12-31 04:54:32,649 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-12-31 04:54:32,653 INFO L448 ceAbstractionStarter]: For program point L576(lines 576 584) no Hoare annotation was computed. [2018-12-31 04:54:32,653 INFO L451 ceAbstractionStarter]: At program point L659(lines 656 660) the Hoare annotation is: true [2018-12-31 04:54:32,653 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:54:32,653 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:54:32,654 INFO L448 ceAbstractionStarter]: For program point L639-2(lines 639 643) no Hoare annotation was computed. [2018-12-31 04:54:32,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:54:32,654 INFO L444 ceAbstractionStarter]: At program point L639-3(lines 639 643) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= ULTIMATE.start_ldv_is_in_set_~s.base |~#s1~0.base|) (= |~#s1~0.offset| (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (= ULTIMATE.start_ldv_set_add_~s.base |~#s1~0.base|) (= (select |#valid| |~#s1~0.base|) 1) (<= (+ |~#s1~0.base| 1) |#StackHeapBarrier|) (<= |~#s1~0.offset| .cse0) (= ULTIMATE.start_ldv_is_in_set_~s.base ULTIMATE.start_ldv_is_in_set_~m~1.base) (<= |~#s1~0.offset| 0) (= |~#s1~0.offset| ULTIMATE.start_ldv_is_in_set_~s.offset) (<= .cse0 |~#s1~0.offset|) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (<= 0 |~#s1~0.offset|) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.base|) (= ULTIMATE.start_foo_~j~0 ULTIMATE.start_ldv_set_add_~new))) [2018-12-31 04:54:32,654 INFO L448 ceAbstractionStarter]: For program point L639-4(lines 639 643) no Hoare annotation was computed. [2018-12-31 04:54:32,654 INFO L448 ceAbstractionStarter]: For program point L639-7(lines 639 643) no Hoare annotation was computed. [2018-12-31 04:54:32,655 INFO L444 ceAbstractionStarter]: At program point L639-8(lines 639 643) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (.cse2 (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (.cse1 (+ |~#s1~0.offset| 4))) (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (not (= |~#s1~0.base| .cse0)) (= ULTIMATE.start_foo_~j~0 (select (select |#memory_int| .cse0) |~#s1~0.offset|)) (= ULTIMATE.start_ldv_is_in_set_~e (select (select |#memory_int| ULTIMATE.start_ldv_is_in_set_~m~1.base) ULTIMATE.start_ldv_is_in_set_~m~1.offset)) (<= .cse1 .cse2) (<= .cse2 .cse1) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= (select |#valid| |~#s1~0.base|) 1) (not (= ULTIMATE.start_ldv_is_in_set_~s.base ULTIMATE.start_ldv_is_in_set_~m~1.base)) (not (= (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4) ULTIMATE.start_ldv_is_in_set_~s.offset)))) [2018-12-31 04:54:32,655 INFO L448 ceAbstractionStarter]: For program point L639-9(lines 639 643) no Hoare annotation was computed. [2018-12-31 04:54:32,655 INFO L444 ceAbstractionStarter]: At program point L565(lines 562 566) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= ULTIMATE.start_ldv_is_in_set_~s.base |~#s1~0.base|) (= |~#s1~0.offset| (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (= ULTIMATE.start_ldv_set_add_~s.base |~#s1~0.base|) (= (select |#valid| |~#s1~0.base|) 1) (<= (+ |~#s1~0.base| 1) |#StackHeapBarrier|) (<= |~#s1~0.offset| .cse0) (= ULTIMATE.start_ldv_is_in_set_~s.base ULTIMATE.start_ldv_is_in_set_~m~1.base) (<= |~#s1~0.offset| 0) (= |~#s1~0.offset| ULTIMATE.start_ldv_is_in_set_~s.offset) (<= .cse0 |~#s1~0.offset|) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (<= 0 |~#s1~0.offset|) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.base|) (not (= |ULTIMATE.start_ldv_successful_malloc_#res.base| |~#s1~0.base|)) (= 0 |ULTIMATE.start_ldv_successful_malloc_#res.offset|) (= ULTIMATE.start_foo_~j~0 ULTIMATE.start_ldv_set_add_~new))) [2018-12-31 04:54:32,655 INFO L448 ceAbstractionStarter]: For program point L619(lines 619 626) no Hoare annotation was computed. [2018-12-31 04:54:32,656 INFO L444 ceAbstractionStarter]: At program point L644(lines 637 645) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= ULTIMATE.start_ldv_is_in_set_~s.base |~#s1~0.base|) (= |~#s1~0.offset| (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (= ULTIMATE.start_ldv_set_add_~s.base |~#s1~0.base|) (= (select |#valid| |~#s1~0.base|) 1) (<= (+ |~#s1~0.base| 1) |#StackHeapBarrier|) (<= |~#s1~0.offset| .cse0) (= 0 |ULTIMATE.start_ldv_is_in_set_#res|) (= ULTIMATE.start_ldv_is_in_set_~s.base ULTIMATE.start_ldv_is_in_set_~m~1.base) (<= |~#s1~0.offset| 0) (= |~#s1~0.offset| ULTIMATE.start_ldv_is_in_set_~s.offset) (<= .cse0 |~#s1~0.offset|) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (<= 0 |~#s1~0.offset|) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.base|) (= ULTIMATE.start_foo_~j~0 ULTIMATE.start_ldv_set_add_~new))) [2018-12-31 04:54:32,656 INFO L444 ceAbstractionStarter]: At program point L644-1(lines 637 645) the Hoare annotation is: (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= 1 |ULTIMATE.start_ldv_is_in_set_#res|) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= (select |#valid| |~#s1~0.base|) 1)) [2018-12-31 04:54:32,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:54:32,656 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 642) no Hoare annotation was computed. [2018-12-31 04:54:32,656 INFO L448 ceAbstractionStarter]: For program point L640-1(lines 640 642) no Hoare annotation was computed. [2018-12-31 04:54:32,656 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 625) no Hoare annotation was computed. [2018-12-31 04:54:32,657 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 654) no Hoare annotation was computed. [2018-12-31 04:54:32,657 INFO L448 ceAbstractionStarter]: For program point L654(line 654) no Hoare annotation was computed. [2018-12-31 04:54:32,657 INFO L448 ceAbstractionStarter]: For program point L654-1(line 654) no Hoare annotation was computed. [2018-12-31 04:54:32,657 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 655) no Hoare annotation was computed. [2018-12-31 04:54:32,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,669 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,678 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,685 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,685 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,686 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,686 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:54:32,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:54:32,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,689 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,690 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,690 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:54:32,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:54:32,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,694 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,695 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,697 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,698 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,701 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,702 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,704 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,705 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:54:32 BoogieIcfgContainer [2018-12-31 04:54:32,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:54:32,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:54:32,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:54:32,709 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:54:32,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:54:28" (3/4) ... [2018-12-31 04:54:32,715 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 04:54:32,733 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-31 04:54:32,734 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-31 04:54:32,763 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((s == s1 && s1 == #memory_$Pointer$[s1][s1]) && s == s1) && \valid[s1] == 1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s == m) && s1 <= 0) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && #memory_$Pointer$[s1][s1] == s1) && j == new [2018-12-31 04:54:32,763 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((s == s1 && s1 == #memory_$Pointer$[s1][s1]) && s == s1) && \valid[s1] == 1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && s == m) && s1 <= 0) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && #memory_$Pointer$[s1][s1] == s1) && !(\result == s1)) && 0 == \result) && j == new [2018-12-31 04:54:32,764 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s1 == s && !(s1 == #memory_$Pointer$[s1][s1])) && j == unknown-#memory_int-unknown[#memory_$Pointer$[s1][s1]][s1]) && e == unknown-#memory_int-unknown[m][m]) && s1 + 4 <= #memory_$Pointer$[s1][s1]) && #memory_$Pointer$[s1][s1] <= s1 + 4) && !(s1 == \result)) && s1 == s) && \valid[s1] == 1) && !(s == m)) && !(m + 4 == s) [2018-12-31 04:54:32,764 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((s1 == s && 1 == \result) && !(s1 == #memory_$Pointer$[s1][s1])) && !(s1 == \result)) && s1 == s) && \valid[s1] == 1 [2018-12-31 04:54:32,827 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:54:32,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:54:32,829 INFO L168 Benchmark]: Toolchain (without parser) took 5661.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 947.3 MB in the beginning and 897.2 MB in the end (delta: 50.2 MB). Peak memory consumption was 196.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:54:32,830 INFO L168 Benchmark]: CDTParser took 0.50 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:54:32,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-31 04:54:32,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:54:32,831 INFO L168 Benchmark]: Boogie Preprocessor took 35.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:54:32,832 INFO L168 Benchmark]: RCFGBuilder took 634.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:54:32,832 INFO L168 Benchmark]: TraceAbstraction took 4077.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.9 MB in the end (delta: 189.7 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:54:32,832 INFO L168 Benchmark]: Witness Printer took 118.30 ms. Allocated memory is still 1.2 GB. Free memory was 903.9 MB in the beginning and 897.2 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:54:32,838 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.50 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 714.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 634.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4077.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.9 MB in the end (delta: 189.7 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. * Witness Printer took 118.30 ms. Allocated memory is still 1.2 GB. Free memory was 903.9 MB in the beginning and 897.2 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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 654]: 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: 637]: Loop Invariant [2018-12-31 04:54:32,851 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,851 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,856 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,857 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((s == s1 && s1 == #memory_$Pointer$[s1][s1]) && s == s1) && \valid[s1] == 1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s == m) && s1 <= 0) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && #memory_$Pointer$[s1][s1] == s1) && j == new - InvariantResult [Line: 637]: Loop Invariant [2018-12-31 04:54:32,861 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,864 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((s1 == s && 1 == \result) && !(s1 == #memory_$Pointer$[s1][s1])) && !(s1 == \result)) && s1 == s) && \valid[s1] == 1 - InvariantResult [Line: 656]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 639]: Loop Invariant [2018-12-31 04:54:32,865 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,866 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,866 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,866 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:54:32,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:54:32,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,874 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,874 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,875 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,875 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:54:32,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:54:32,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((s1 == s && !(s1 == #memory_$Pointer$[s1][s1])) && j == unknown-#memory_int-unknown[#memory_$Pointer$[s1][s1]][s1]) && e == unknown-#memory_int-unknown[m][m]) && s1 + 4 <= #memory_$Pointer$[s1][s1]) && #memory_$Pointer$[s1][s1] <= s1 + 4) && !(s1 == \result)) && s1 == s) && \valid[s1] == 1) && !(s == m)) && !(m + 4 == s) - InvariantResult [Line: 639]: Loop Invariant [2018-12-31 04:54:32,884 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,884 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,886 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((s == s1 && s1 == #memory_$Pointer$[s1][s1]) && s == s1) && \valid[s1] == 1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && s == m) && s1 <= 0) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && #memory_$Pointer$[s1][s1] == s1) && j == new - InvariantResult [Line: 562]: Loop Invariant [2018-12-31 04:54:32,888 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,892 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,894 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:54:32,895 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 04:54:32,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:54:32,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 04:54:32,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((((s == s1 && s1 == #memory_$Pointer$[s1][s1]) && s == s1) && \valid[s1] == 1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && s == m) && s1 <= 0) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && #memory_$Pointer$[s1][s1] == s1) && !(\result == s1)) && 0 == \result) && j == new - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 106 SDslu, 108 SDs, 0 SdLazy, 81 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, 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, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 285 HoareAnnotationTreeSize, 6 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 6055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...