./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum04_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/sum04_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer --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 aeade23d65797ff650f62ff8e383f015764d9ed2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:42:18,193 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:42:18,194 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:42:18,203 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:42:18,203 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:42:18,204 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:42:18,205 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:42:18,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:42:18,208 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:42:18,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:42:18,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:42:18,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:42:18,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:42:18,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:42:18,211 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:42:18,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:42:18,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:42:18,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:42:18,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:42:18,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:42:18,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:42:18,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:42:18,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:42:18,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:42:18,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:42:18,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:42:18,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:42:18,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:42:18,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:42:18,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:42:18,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:42:18,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:42:18,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:42:18,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:42:18,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:42:18,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:42:18,227 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 05:42:18,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:42:18,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:42:18,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:42:18,239 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:42:18,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:42:18,239 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:42:18,239 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:42:18,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:42:18,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:42:18,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:42:18,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:42:18,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:42:18,240 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:42:18,240 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:42:18,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:42:18,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:42:18,241 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:42:18,241 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:42:18,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:42:18,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:42:18,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:42:18,241 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:42:18,241 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:42:18,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:42:18,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:42:18,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:42:18,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:42:18,242 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:42:18,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:42:18,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:42:18,243 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer 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 -> aeade23d65797ff650f62ff8e383f015764d9ed2 [2018-11-23 05:42:18,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:42:18,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:42:18,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:42:18,275 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:42:18,275 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:42:18,275 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/../../sv-benchmarks/c/loops/sum04_false-unreach-call_true-termination.i [2018-11-23 05:42:18,311 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/data/db8f0fde0/9d0b146171104ea1819678927983f55d/FLAGc62021512 [2018-11-23 05:42:18,648 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:42:18,648 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/sv-benchmarks/c/loops/sum04_false-unreach-call_true-termination.i [2018-11-23 05:42:18,653 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/data/db8f0fde0/9d0b146171104ea1819678927983f55d/FLAGc62021512 [2018-11-23 05:42:19,071 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/data/db8f0fde0/9d0b146171104ea1819678927983f55d [2018-11-23 05:42:19,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:42:19,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:42:19,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:42:19,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:42:19,077 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:42:19,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee9d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19, skipping insertion in model container [2018-11-23 05:42:19,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:42:19,098 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:42:19,201 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:42:19,203 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:42:19,211 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:42:19,219 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:42:19,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19 WrapperNode [2018-11-23 05:42:19,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:42:19,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:42:19,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:42:19,220 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:42:19,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:42:19,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:42:19,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:42:19,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:42:19,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... [2018-11-23 05:42:19,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:42:19,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:42:19,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:42:19,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:42:19,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:42:19,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:42:19,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:42:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:42:19,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:42:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:42:19,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:42:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:42:19,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:42:19,394 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:42:19,394 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 05:42:19,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:42:19 BoogieIcfgContainer [2018-11-23 05:42:19,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:42:19,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:42:19,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:42:19,398 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:42:19,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:42:19" (1/3) ... [2018-11-23 05:42:19,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56df25d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:42:19, skipping insertion in model container [2018-11-23 05:42:19,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:42:19" (2/3) ... [2018-11-23 05:42:19,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56df25d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:42:19, skipping insertion in model container [2018-11-23 05:42:19,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:42:19" (3/3) ... [2018-11-23 05:42:19,400 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_false-unreach-call_true-termination.i [2018-11-23 05:42:19,405 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:42:19,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:42:19,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:42:19,436 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:42:19,436 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:42:19,437 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:42:19,437 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:42:19,437 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:42:19,437 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:42:19,437 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:42:19,437 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:42:19,437 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:42:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 05:42:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:42:19,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:19,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:19,452 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:19,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 05:42:19,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:19,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:19,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:19,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:42:19,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:42:19,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:42:19,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:42:19,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:42:19,539 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 05:42:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:19,550 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 05:42:19,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:42:19,551 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 05:42:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:19,556 INFO L225 Difference]: With dead ends: 30 [2018-11-23 05:42:19,556 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 05:42:19,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:42:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 05:42:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 05:42:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 05:42:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 05:42:19,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 05:42:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:19,580 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 05:42:19,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:42:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 05:42:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:42:19,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:19,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:19,581 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:19,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2018-11-23 05:42:19,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:19,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:19,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:19,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:19,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:19,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:42:19,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:42:19,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:42:19,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:42:19,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:42:19,612 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-23 05:42:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:19,642 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 05:42:19,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:42:19,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 05:42:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:19,643 INFO L225 Difference]: With dead ends: 24 [2018-11-23 05:42:19,643 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 05:42:19,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:42:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 05:42:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 05:42:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 05:42:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 05:42:19,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-23 05:42:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:19,647 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 05:42:19,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:42:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 05:42:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:42:19,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:19,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:19,648 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:19,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2018-11-23 05:42:19,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:19,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:19,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:19,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:19,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:19,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:19,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:19,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:42:19,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-23 05:42:19,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:42:19,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:42:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:42:19,766 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 6 states. [2018-11-23 05:42:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:19,804 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2018-11-23 05:42:19,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:42:19,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 05:42:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:19,805 INFO L225 Difference]: With dead ends: 33 [2018-11-23 05:42:19,805 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 05:42:19,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:42:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 05:42:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 05:42:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 05:42:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 05:42:19,809 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2018-11-23 05:42:19,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:19,810 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 05:42:19,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:42:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 05:42:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 05:42:19,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:19,810 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:19,810 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:19,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:19,811 INFO L82 PathProgramCache]: Analyzing trace with hash -452912071, now seen corresponding path program 1 times [2018-11-23 05:42:19,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:19,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:19,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:19,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 05:42:19,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:19,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:19,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:19,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:19,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:19,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 7 [2018-11-23 05:42:19,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:42:19,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:42:19,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:42:19,943 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-11-23 05:42:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:19,986 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 05:42:19,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:42:19,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 05:42:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:19,988 INFO L225 Difference]: With dead ends: 39 [2018-11-23 05:42:19,988 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 05:42:19,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:42:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 05:42:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 05:42:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 05:42:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 05:42:19,993 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2018-11-23 05:42:19,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:19,994 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 05:42:19,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:42:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 05:42:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:42:19,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:19,995 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:19,995 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:19,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:19,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1902732141, now seen corresponding path program 2 times [2018-11-23 05:42:19,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:19,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:19,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:19,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:42:19,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:42:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:20,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:42:20,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:42:20,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:42:20,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:42:20,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:42:20,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:42:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:42:20,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:42:20,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 05:42:20,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:42:20,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:42:20,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:42:20,130 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2018-11-23 05:42:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:42:20,170 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 05:42:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:42:20,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 05:42:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:42:20,171 INFO L225 Difference]: With dead ends: 40 [2018-11-23 05:42:20,171 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 05:42:20,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:42:20,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 05:42:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 05:42:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 05:42:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-23 05:42:20,176 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 31 [2018-11-23 05:42:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:42:20,176 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 05:42:20,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:42:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 05:42:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:42:20,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:42:20,177 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:42:20,177 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:42:20,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:42:20,178 INFO L82 PathProgramCache]: Analyzing trace with hash 749989817, now seen corresponding path program 3 times [2018-11-23 05:42:20,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:42:20,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:42:20,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:20,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:42:20,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:42:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:42:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:42:20,207 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret1 := main(); [?] havoc ~i~0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=1, main_~sn~0=0] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~sn~0=2] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2, main_~sn~0=2] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=2, main_~sn~0=2] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~sn~0=4] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3, main_~sn~0=4] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=3, main_~sn~0=4] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=4, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=4, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=5, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=5, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=5, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=6, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=6, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=6, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=7, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=7, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=7, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=8, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=8, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=8, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=9, main_~sn~0=6] [?] assume !(~i~0 <= 8); VAL [main_~i~0=9, main_~sn~0=6] [?] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=1, ~sn~0=0] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=2, ~sn~0=2] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=3, ~sn~0=4] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=4, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=5, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=6, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=7, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=8, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] assume !(~i~0 <= 8); VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=1, ~sn~0=0] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=2, ~sn~0=2] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=3, ~sn~0=4] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=4, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=5, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=6, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=7, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=8, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] assume !(~i~0 <= 8); VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 05:42:20,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:42:20 BoogieIcfgContainer [2018-11-23 05:42:20,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:42:20,234 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:42:20,234 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:42:20,234 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:42:20,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:42:19" (3/4) ... [2018-11-23 05:42:20,236 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret1 := main(); [?] havoc ~i~0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=1, main_~sn~0=0] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~sn~0=2] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2, main_~sn~0=2] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=2, main_~sn~0=2] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~sn~0=4] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3, main_~sn~0=4] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=3, main_~sn~0=4] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=4, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=4, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=5, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=5, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=5, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=6, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=6, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=6, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=7, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=7, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=7, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=8, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=8, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=8, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=9, main_~sn~0=6] [?] assume !(~i~0 <= 8); VAL [main_~i~0=9, main_~sn~0=6] [?] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=1, ~sn~0=0] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=2, ~sn~0=2] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=3, ~sn~0=4] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=4, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=5, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=6, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=7, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=8, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] assume !(~i~0 <= 8); VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=1, ~sn~0=0] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=2, ~sn~0=2] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=3, ~sn~0=4] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=4, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=5, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=6, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=7, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=8, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] assume !(~i~0 <= 8); VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 05:42:20,278 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c36e931-9df5-4cc7-b5d0-42e13776cbd7/bin-2019/uautomizer/witness.graphml [2018-11-23 05:42:20,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:42:20,279 INFO L168 Benchmark]: Toolchain (without parser) took 1205.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -83.0 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:20,280 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:42:20,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:20,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 10.98 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:42:20,281 INFO L168 Benchmark]: Boogie Preprocessor took 10.92 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:20,281 INFO L168 Benchmark]: RCFGBuilder took 153.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -202.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:20,282 INFO L168 Benchmark]: TraceAbstraction took 838.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:20,282 INFO L168 Benchmark]: Witness Printer took 44.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:42:20,284 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 10.98 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.92 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 153.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -202.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 838.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 11.5 GB. * Witness Printer took 44.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 48 SDslu, 112 SDs, 0 SdLazy, 86 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=5, 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, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 6606 SizeOfPredicates, 2 NumberOfNonLiveVariables, 134 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 28/186 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...