./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum01_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_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/sum01_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/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 5cba8acfa381c990ec40e4bf9e5d202ee845a576 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:49:28,604 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:49:28,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:49:28,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:49:28,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:49:28,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:49:28,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:49:28,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:49:28,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:49:28,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:49:28,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:49:28,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:49:28,618 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:49:28,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:49:28,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:49:28,620 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:49:28,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:49:28,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:49:28,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:49:28,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:49:28,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:49:28,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:49:28,628 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:49:28,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:49:28,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:49:28,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:49:28,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:49:28,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:49:28,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:49:28,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:49:28,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:49:28,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:49:28,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:49:28,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:49:28,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:49:28,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:49:28,635 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 05:49:28,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:49:28,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:49:28,646 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:49:28,647 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:49:28,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:49:28,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:49:28,647 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:49:28,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:49:28,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:49:28,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:49:28,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:49:28,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:49:28,648 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:49:28,648 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:49:28,649 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:49:28,649 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:49:28,649 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:49:28,649 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:49:28,649 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:49:28,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:49:28,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:49:28,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:49:28,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:49:28,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:49:28,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:49:28,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:49:28,650 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:49:28,650 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:49:28,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:49:28,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:49:28,651 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_0c354032-9071-4d14-814f-cfa25bd9244c/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 -> 5cba8acfa381c990ec40e4bf9e5d202ee845a576 [2018-11-23 05:49:28,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:49:28,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:49:28,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:49:28,688 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:49:28,688 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:49:28,689 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/../../sv-benchmarks/c/loops/sum01_false-unreach-call_true-termination.i [2018-11-23 05:49:28,734 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/data/b6067b75c/ac5d705b0da64e708ebecb76e8dd381c/FLAG9d8f5dd06 [2018-11-23 05:49:29,062 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:49:29,062 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/sv-benchmarks/c/loops/sum01_false-unreach-call_true-termination.i [2018-11-23 05:49:29,068 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/data/b6067b75c/ac5d705b0da64e708ebecb76e8dd381c/FLAG9d8f5dd06 [2018-11-23 05:49:29,494 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/data/b6067b75c/ac5d705b0da64e708ebecb76e8dd381c [2018-11-23 05:49:29,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:49:29,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:49:29,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:49:29,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:49:29,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:49:29,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:49:29" (1/1) ... [2018-11-23 05:49:29,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468ecb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29, skipping insertion in model container [2018-11-23 05:49:29,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:49:29" (1/1) ... [2018-11-23 05:49:29,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:49:29,521 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:49:29,631 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:49:29,633 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:49:29,645 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:49:29,656 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:49:29,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29 WrapperNode [2018-11-23 05:49:29,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:49:29,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:49:29,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:49:29,657 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:49:29,661 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:49:29" (1/1) ... [2018-11-23 05:49:29,664 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:49:29" (1/1) ... [2018-11-23 05:49:29,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:49:29,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:49:29,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:49:29,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:49:29,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29" (1/1) ... [2018-11-23 05:49:29,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29" (1/1) ... [2018-11-23 05:49:29,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29" (1/1) ... [2018-11-23 05:49:29,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29" (1/1) ... [2018-11-23 05:49:29,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29" (1/1) ... [2018-11-23 05:49:29,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29" (1/1) ... [2018-11-23 05:49:29,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29" (1/1) ... [2018-11-23 05:49:29,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:49:29,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:49:29,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:49:29,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:49:29,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/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:49:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:49:29,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:49:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:49:29,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:49:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:49:29,748 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:49:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:49:29,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:49:29,831 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:49:29,831 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 05:49:29,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:49:29 BoogieIcfgContainer [2018-11-23 05:49:29,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:49:29,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:49:29,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:49:29,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:49:29,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:49:29" (1/3) ... [2018-11-23 05:49:29,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83dbef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:49:29, skipping insertion in model container [2018-11-23 05:49:29,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:49:29" (2/3) ... [2018-11-23 05:49:29,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@83dbef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:49:29, skipping insertion in model container [2018-11-23 05:49:29,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:49:29" (3/3) ... [2018-11-23 05:49:29,837 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_false-unreach-call_true-termination.i [2018-11-23 05:49:29,843 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:49:29,847 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:49:29,856 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:49:29,874 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:49:29,874 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:49:29,874 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:49:29,874 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:49:29,874 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:49:29,875 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:49:29,875 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:49:29,875 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:49:29,875 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:49:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 05:49:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:49:29,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:29,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:29,895 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:29,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 05:49:29,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:29,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:29,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:29,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:29,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:29,972 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:49:29,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:29,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:49:29,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:49:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:49:29,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:49:29,986 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 05:49:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:30,002 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 05:49:30,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:49:30,003 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 05:49:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:30,008 INFO L225 Difference]: With dead ends: 30 [2018-11-23 05:49:30,008 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 05:49:30,010 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:49:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 05:49:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 05:49:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 05:49:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 05:49:30,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 05:49:30,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:30,031 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 05:49:30,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:49:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 05:49:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:49:30,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:30,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:30,032 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:30,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:30,032 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2018-11-23 05:49:30,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:30,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:30,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:30,080 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:49:30,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:49:30,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:49:30,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:49:30,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:49:30,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:49:30,082 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 05:49:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:30,109 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 05:49:30,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:49:30,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 05:49:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:30,111 INFO L225 Difference]: With dead ends: 21 [2018-11-23 05:49:30,111 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 05:49:30,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:49:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 05:49:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 05:49:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 05:49:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 05:49:30,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2018-11-23 05:49:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:30,115 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 05:49:30,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:49:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 05:49:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:49:30,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:30,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:30,116 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:30,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2018-11-23 05:49:30,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:30,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:30,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:30,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:30,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:30,319 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:49:30,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:49:30,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/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:49:30,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:30,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:49:30,459 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:49:30,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:49:30,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 05:49:30,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 05:49:30,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 05:49:30,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:49:30,475 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 14 states. [2018-11-23 05:49:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:30,649 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 05:49:30,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 05:49:30,650 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-11-23 05:49:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:30,651 INFO L225 Difference]: With dead ends: 37 [2018-11-23 05:49:30,651 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 05:49:30,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:49:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 05:49:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 05:49:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 05:49:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 05:49:30,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-11-23 05:49:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:30,656 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 05:49:30,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 05:49:30,656 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 05:49:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:49:30,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:30,657 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:30,657 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:30,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:30,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1350121109, now seen corresponding path program 1 times [2018-11-23 05:49:30,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:30,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:30,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:30,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:49:30,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/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:49:30,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:30,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:49:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:30,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:49:30,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 05:49:30,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:49:30,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:49:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:49:30,728 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-11-23 05:49:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:30,751 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 05:49:30,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:49:30,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 05:49:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:30,752 INFO L225 Difference]: With dead ends: 30 [2018-11-23 05:49:30,752 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 05:49:30,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:49:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 05:49:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 05:49:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 05:49:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 05:49:30,756 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 05:49:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:30,757 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 05:49:30,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:49:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 05:49:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:49:30,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:30,759 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:30,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:30,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash -424886253, now seen corresponding path program 2 times [2018-11-23 05:49:30,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:30,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:30,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:49:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 05:49:30,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:49:30,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/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:49:30,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:49:30,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:49:30,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:49:30,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:49:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:49:31,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2018-11-23 05:49:31,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 05:49:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 05:49:31,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-11-23 05:49:31,054 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 19 states. [2018-11-23 05:49:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:31,329 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 05:49:31,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 05:49:31,329 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-23 05:49:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:31,330 INFO L225 Difference]: With dead ends: 40 [2018-11-23 05:49:31,330 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 05:49:31,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 05:49:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 05:49:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 05:49:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 05:49:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 05:49:31,334 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2018-11-23 05:49:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:31,334 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 05:49:31,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 05:49:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 05:49:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:49:31,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:31,335 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:31,336 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:31,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1753373675, now seen corresponding path program 2 times [2018-11-23 05:49:31,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:31,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:31,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:49:31,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:49:31,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:49:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:49:31,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:49:31,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:49:31,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:49:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:49:31,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 05:49:31,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:49:31,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:49:31,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:49:31,408 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2018-11-23 05:49:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:31,426 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 05:49:31,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:49:31,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 05:49:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:31,426 INFO L225 Difference]: With dead ends: 39 [2018-11-23 05:49:31,426 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 05:49:31,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:49:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 05:49:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 05:49:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 05:49:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 05:49:31,430 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2018-11-23 05:49:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:31,430 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 05:49:31,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:49:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 05:49:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 05:49:31,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:31,431 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:31,431 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:31,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1094958777, now seen corresponding path program 3 times [2018-11-23 05:49:31,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:31,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:31,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:49:31,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:49:31,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:49:31,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:49:31,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 05:49:31,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:49:31,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:49:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:49:31,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 05:49:31,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:49:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:49:31,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:49:31,546 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2018-11-23 05:49:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:31,573 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 05:49:31,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:49:31,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 05:49:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:31,574 INFO L225 Difference]: With dead ends: 42 [2018-11-23 05:49:31,574 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 05:49:31,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:49:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 05:49:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 05:49:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 05:49:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 05:49:31,579 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2018-11-23 05:49:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:31,579 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 05:49:31,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:49:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 05:49:31,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:49:31,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:31,580 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:31,580 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:31,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:31,580 INFO L82 PathProgramCache]: Analyzing trace with hash 98169237, now seen corresponding path program 4 times [2018-11-23 05:49:31,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:31,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:31,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:49:31,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:49:31,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:49:31,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:49:31,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:49:31,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:49:31,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:49:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:49:31,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 05:49:31,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:49:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:49:31,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:49:31,660 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 9 states. [2018-11-23 05:49:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:31,687 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 05:49:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:49:31,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 05:49:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:31,689 INFO L225 Difference]: With dead ends: 45 [2018-11-23 05:49:31,689 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 05:49:31,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:49:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 05:49:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 05:49:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 05:49:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 05:49:31,694 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2018-11-23 05:49:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:31,695 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 05:49:31,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:49:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 05:49:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:49:31,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:31,696 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:31,696 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:31,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:31,696 INFO L82 PathProgramCache]: Analyzing trace with hash 144867641, now seen corresponding path program 5 times [2018-11-23 05:49:31,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:31,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:49:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:49:31,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:49:31,750 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:49:31,759 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 05:49:31,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:49:31,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:49:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:49:31,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 05:49:31,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:49:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:49:31,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:49:31,782 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-23 05:49:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:31,833 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 05:49:31,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:49:31,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 05:49:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:31,834 INFO L225 Difference]: With dead ends: 48 [2018-11-23 05:49:31,834 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 05:49:31,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 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:49:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 05:49:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 05:49:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 05:49:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 05:49:31,837 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2018-11-23 05:49:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:31,839 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 05:49:31,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:49:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 05:49:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 05:49:31,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:31,839 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:31,840 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:31,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash -232382699, now seen corresponding path program 6 times [2018-11-23 05:49:31,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:31,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:49:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:49:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:49:31,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:49:31,923 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:49:31,935 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 05:49:31,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:49:31,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:49:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:49:31,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:49:31,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 05:49:31,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 05:49:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:49:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:49:31,958 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 11 states. [2018-11-23 05:49:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:49:31,981 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 05:49:31,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:49:31,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 05:49:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:49:31,982 INFO L225 Difference]: With dead ends: 51 [2018-11-23 05:49:31,982 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 05:49:31,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:49:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 05:49:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 05:49:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 05:49:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 05:49:31,985 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2018-11-23 05:49:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:49:31,985 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 05:49:31,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 05:49:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 05:49:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 05:49:31,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:49:31,985 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:49:31,985 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:49:31,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:49:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1032151993, now seen corresponding path program 7 times [2018-11-23 05:49:31,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:49:31,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:49:31,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:49:31,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:49:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:49:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:49:32,016 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~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=0] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=2] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=4] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=6] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=8] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=8] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=8] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=10] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=10] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=10] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=12] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=12] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=12] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=14] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=14] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=14] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=16] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=16] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=16] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=18] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] assume !(~i~0 < 10); VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=11, main_~n~0=10, main_~sn~0=18] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=11, main_~n~0=10, main_~sn~0=18] [?] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14-L15] assume !(~i~0 < 10); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14-L15] assume !(~i~0 < 10); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=10] [L13] COND TRUE i<=n VAL [i=1, n=0, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=2, n=10] [L13] i++ VAL [i=2, n=2, n=10] [L13] COND TRUE i<=n VAL [i=2, n=2, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=10, n=4] [L13] COND TRUE i<=n VAL [i=3, n=10, n=4] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=10, n=6] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=8, n=10] [L13] i++ VAL [i=5, n=10, n=8] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=10, n=12] [L13] i++ VAL [i=7, n=12, n=10] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=10, n=14] [L13] i++ VAL [i=8, n=10, n=14] [L13] COND TRUE i<=n VAL [i=8, n=10, n=14] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=16, n=10] [L13] COND TRUE i<=n VAL [i=9, n=10, n=16] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=18, n=10] [L13] COND TRUE i<=n VAL [i=10, n=18, n=10] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=10, n=18] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L17] CALL __VERIFIER_assert(sn==n*(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:49:32,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:49:32 BoogieIcfgContainer [2018-11-23 05:49:32,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:49:32,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:49:32,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:49:32,053 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:49:32,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:49:29" (3/4) ... [2018-11-23 05:49:32,056 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~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=0] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=2] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=4] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=6] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=8] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=8] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=8] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=10] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=10] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=10] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=12] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=12] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=12] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=14] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=14] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=14] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=16] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=16] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=16] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=18] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] assume !(~i~0 < 10); VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=11, main_~n~0=10, main_~sn~0=18] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=11, main_~n~0=10, main_~sn~0=18] [?] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14-L15] assume !(~i~0 < 10); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14-L15] assume !(~i~0 < 10); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=10, n=0] [L13] COND TRUE i<=n VAL [i=1, n=10, n=0] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=10, n=2] [L13] i++ VAL [i=2, n=2, n=10] [L13] COND TRUE i<=n VAL [i=2, n=10, n=2] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=4, n=10] [L13] COND TRUE i<=n VAL [i=3, n=4, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=6, n=10] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=8, n=10] [L13] i++ VAL [i=5, n=8, n=10] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=12, n=10] [L13] i++ VAL [i=7, n=10, n=12] [L13] COND TRUE i<=n VAL [i=7, n=10, n=12] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=14, n=10] [L13] i++ VAL [i=8, n=14, n=10] [L13] COND TRUE i<=n VAL [i=8, n=14, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=10, n=16] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=10, n=18] [L13] i++ VAL [i=10, n=18, n=10] [L13] COND TRUE i<=n VAL [i=10, n=10, n=18] [L14] COND FALSE !(i<10) VAL [i=10, n=10, n=18] [L13] i++ VAL [i=11, n=18, n=10] [L13] COND FALSE !(i<=n) VAL [i=11, n=18, n=10] [L17] CALL __VERIFIER_assert(sn==n*(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:49:32,148 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0c354032-9071-4d14-814f-cfa25bd9244c/bin-2019/uautomizer/witness.graphml [2018-11-23 05:49:32,148 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:49:32,149 INFO L168 Benchmark]: Toolchain (without parser) took 2653.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 958.0 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:49:32,150 INFO L168 Benchmark]: CDTParser took 0.19 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:49:32,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.18 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 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:49:32,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.70 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:49:32,151 INFO L168 Benchmark]: Boogie Preprocessor took 11.48 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 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:49:32,151 INFO L168 Benchmark]: RCFGBuilder took 151.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:49:32,151 INFO L168 Benchmark]: TraceAbstraction took 2221.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.5 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:49:32,151 INFO L168 Benchmark]: Witness Printer took 95.25 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: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:49:32,153 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.19 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 159.18 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.70 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.48 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 151.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2221.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.5 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * Witness Printer took 95.25 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: 5.0 MB). Peak memory consumption was 5.0 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, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=10] [L13] COND TRUE i<=n VAL [i=1, n=0, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=2, n=10] [L13] i++ VAL [i=2, n=2, n=10] [L13] COND TRUE i<=n VAL [i=2, n=2, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=10, n=4] [L13] COND TRUE i<=n VAL [i=3, n=10, n=4] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=10, n=6] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=8, n=10] [L13] i++ VAL [i=5, n=10, n=8] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=10, n=12] [L13] i++ VAL [i=7, n=12, n=10] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=10, n=14] [L13] i++ VAL [i=8, n=10, n=14] [L13] COND TRUE i<=n VAL [i=8, n=10, n=14] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=16, n=10] [L13] COND TRUE i<=n VAL [i=9, n=10, n=16] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=18, n=10] [L13] COND TRUE i<=n VAL [i=10, n=18, n=10] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=10, n=18] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L17] CALL __VERIFIER_assert(sn==n*(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, 2.1s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 114 SDtfs, 63 SDslu, 368 SDs, 0 SdLazy, 450 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 29790 SizeOfPredicates, 12 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 145/780 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...