./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum01_bug02_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_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/sum01_bug02_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5465a084053aead702161d951dd339bfa1665d5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:46:53,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:46:53,180 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:46:53,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:46:53,189 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:46:53,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:46:53,190 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:46:53,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:46:53,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:46:53,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:46:53,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:46:53,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:46:53,196 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:46:53,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:46:53,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:46:53,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:46:53,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:46:53,200 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:46:53,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:46:53,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:46:53,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:46:53,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:46:53,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:46:53,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:46:53,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:46:53,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:46:53,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:46:53,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:46:53,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:46:53,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:46:53,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:46:53,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:46:53,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:46:53,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:46:53,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:46:53,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:46:53,211 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 13:46:53,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:46:53,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:46:53,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:46:53,221 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:46:53,221 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:46:53,221 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:46:53,222 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:46:53,222 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 13:46:53,222 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:46:53,222 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:46:53,222 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 13:46:53,222 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 13:46:53,222 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:46:53,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:46:53,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:46:53,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:46:53,224 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:46:53,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:46:53,224 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:46:53,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:46:53,224 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:46:53,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:46:53,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:46:53,225 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:46:53,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:46:53,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:46:53,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:46:53,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:46:53,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:46:53,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:46:53,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:46:53,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:46:53,226 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:46:53,226 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 13:46:53,226 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:46:53,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:46:53,227 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:46:53,227 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan 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 -> Taipan 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 -> c5465a084053aead702161d951dd339bfa1665d5 [2018-11-23 13:46:53,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:46:53,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:46:53,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:46:53,268 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:46:53,269 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:46:53,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/../../sv-benchmarks/c/loops/sum01_bug02_false-unreach-call_true-termination.i [2018-11-23 13:46:53,317 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/data/4aeccfe72/e83eaf53f020413f8b7a5c782d39327f/FLAGe935ca686 [2018-11-23 13:46:53,679 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:46:53,680 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/sv-benchmarks/c/loops/sum01_bug02_false-unreach-call_true-termination.i [2018-11-23 13:46:53,686 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/data/4aeccfe72/e83eaf53f020413f8b7a5c782d39327f/FLAGe935ca686 [2018-11-23 13:46:53,700 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/data/4aeccfe72/e83eaf53f020413f8b7a5c782d39327f [2018-11-23 13:46:53,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:46:53,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:46:53,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:46:53,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:46:53,710 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:46:53,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd21f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53, skipping insertion in model container [2018-11-23 13:46:53,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:46:53,743 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:46:53,876 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:46:53,879 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:46:53,890 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:46:53,901 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:46:53,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53 WrapperNode [2018-11-23 13:46:53,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:46:53,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:46:53,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:46:53,903 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:46:53,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:46:53,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:46:53,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:46:53,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:46:53,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... [2018-11-23 13:46:53,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:46:53,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:46:53,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:46:53,934 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:46:53,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/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 13:46:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:46:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:46:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:46:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:46:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:46:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:46:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:46:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:46:54,147 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:46:54,147 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:46:54,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:54 BoogieIcfgContainer [2018-11-23 13:46:54,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:46:54,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:46:54,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:46:54,150 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:46:54,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:46:53" (1/3) ... [2018-11-23 13:46:54,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4263d929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:46:54, skipping insertion in model container [2018-11-23 13:46:54,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:53" (2/3) ... [2018-11-23 13:46:54,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4263d929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:46:54, skipping insertion in model container [2018-11-23 13:46:54,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:54" (3/3) ... [2018-11-23 13:46:54,153 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_false-unreach-call_true-termination.i [2018-11-23 13:46:54,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:46:54,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:46:54,178 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:46:54,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:46:54,211 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:46:54,211 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:46:54,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:46:54,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:46:54,211 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:46:54,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:46:54,211 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:46:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:46:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:46:54,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:54,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:54,231 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:54,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-23 13:46:54,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:54,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:46:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:54,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:54,327 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 13:46:54,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:46:54,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:46:54,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:46:54,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:46:54,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:46:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:46:54,345 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 13:46:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:46:54,363 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:46:54,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:46:54,364 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:46:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:46:54,370 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:46:54,370 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:46:54,373 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 13:46:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:46:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:46:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:46:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:46:54,400 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 13:46:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:46:54,400 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:46:54,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:46:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:46:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:46:54,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:54,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:54,401 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:54,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash -158964811, now seen corresponding path program 1 times [2018-11-23 13:46:54,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:54,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:46:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:54,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:54,474 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 13:46:54,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:46:54,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:46:54,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:46:54,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:46:54,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:46:54,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:46:54,477 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-23 13:46:54,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:46:54,511 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 13:46:54,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:46:54,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:46:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:46:54,512 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:46:54,513 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:46:54,513 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 13:46:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:46:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:46:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:46:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-23 13:46:54,518 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2018-11-23 13:46:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:46:54,518 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 13:46:54,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:46:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 13:46:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:46:54,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:54,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:54,520 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:54,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:54,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1017948080, now seen corresponding path program 1 times [2018-11-23 13:46:54,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:54,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:54,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:46:54,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:54,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:54,720 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 13:46:54,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:54,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:46:54,721 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-23 13:46:54,723 INFO L202 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [21], [27], [30], [32], [38], [39], [40], [42] [2018-11-23 13:46:54,750 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 13:46:54,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 13:46:54,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 13:46:54,917 INFO L272 AbstractInterpreter]: Visited 14 different actions 48 times. Merged at 5 different actions 19 times. Widened at 1 different actions 2 times. Performed 135 root evaluator evaluations with a maximum evaluation depth of 6. Performed 135 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 7 variables. [2018-11-23 13:46:54,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:54,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 13:46:54,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:54,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/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 13:46:54,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:46:54,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 13:46:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:54,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:46:55,116 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 13:46:55,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:46:55,286 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 13:46:55,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:46:55,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-11-23 13:46:55,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:46:55,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:46:55,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:46:55,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:46:55,306 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 14 states. [2018-11-23 13:46:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:46:55,524 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 13:46:55,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:46:55,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-11-23 13:46:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:46:55,527 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:46:55,527 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:46:55,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:46:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:46:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2018-11-23 13:46:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:46:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 13:46:55,532 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2018-11-23 13:46:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:46:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 13:46:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:46:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 13:46:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:46:55,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:55,533 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:55,533 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:55,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -852639511, now seen corresponding path program 1 times [2018-11-23 13:46:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:55,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:46:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:55,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:46:55,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:46:55,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:46:55,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:46:55,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:46:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:46:55,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:46:55,553 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-23 13:46:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:46:55,567 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 13:46:55,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:46:55,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 13:46:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:46:55,568 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:46:55,568 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:46:55,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:46:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:46:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:46:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:46:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:46:55,573 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2018-11-23 13:46:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:46:55,573 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:46:55,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:46:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:46:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:46:55,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:55,574 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:55,575 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:55,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:55,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1920151575, now seen corresponding path program 2 times [2018-11-23 13:46:55,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:55,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:55,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:46:55,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:55,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:55,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:55,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:46:55,606 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:46:55,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:46:55,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:55,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/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 13:46:55,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:46:55,613 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 13:46:55,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:46:55,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:46:55,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:46:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:55,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:46:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:55,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:46:55,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-23 13:46:55,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:46:55,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:46:55,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:46:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:46:55,695 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2018-11-23 13:46:55,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:46:55,721 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 13:46:55,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:46:55,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:46:55,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:46:55,723 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:46:55,723 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:46:55,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:46:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:46:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:46:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:46:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 13:46:55,728 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-11-23 13:46:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:46:55,728 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 13:46:55,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:46:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 13:46:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:46:55,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:55,729 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:55,729 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:55,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:55,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1780946716, now seen corresponding path program 3 times [2018-11-23 13:46:55,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:55,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:55,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:46:55,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:55,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:55,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:55,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:46:55,787 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:46:55,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:46:55,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:55,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/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 13:46:55,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:46:55,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 13:46:55,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:46:55,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:46:55,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:46:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:55,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:46:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:55,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:46:55,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-23 13:46:55,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:46:55,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:46:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:46:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=130, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:46:55,911 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-11-23 13:46:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:46:55,946 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 13:46:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:46:55,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 13:46:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:46:55,946 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:46:55,947 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:46:55,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=130, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:46:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:46:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 13:46:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:46:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 13:46:55,950 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-11-23 13:46:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:46:55,950 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 13:46:55,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:46:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 13:46:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:46:55,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:55,951 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:55,951 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:55,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash -971600090, now seen corresponding path program 2 times [2018-11-23 13:46:55,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:55,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:46:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:55,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:46:56,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:56,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:46:56,064 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:46:56,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:46:56,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:56,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/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 13:46:56,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:46:56,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 13:46:56,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:46:56,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:46:56,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:46:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:56,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:46:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:56,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:46:56,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2018-11-23 13:46:56,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:46:56,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:46:56,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:46:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:46:56,459 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 19 states. [2018-11-23 13:46:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:46:56,771 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 13:46:56,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:46:56,771 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2018-11-23 13:46:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:46:56,772 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:46:56,772 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:46:56,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:46:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:46:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-11-23 13:46:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:46:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 13:46:56,776 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2018-11-23 13:46:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:46:56,776 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 13:46:56,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:46:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:46:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:46:56,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:56,777 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:56,777 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:56,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash -131462049, now seen corresponding path program 4 times [2018-11-23 13:46:56,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:56,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:46:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:56,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:56,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:56,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:46:56,837 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:46:56,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:46:56,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:56,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/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 13:46:56,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:46:56,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 13:46:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:56,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:46:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:56,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:46:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:56,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:46:56,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-11-23 13:46:56,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:46:56,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:46:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:46:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:46:56,979 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 16 states. [2018-11-23 13:46:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:46:57,021 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 13:46:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:46:57,022 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-11-23 13:46:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:46:57,022 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:46:57,022 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:46:57,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:46:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:46:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 13:46:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:46:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 13:46:57,027 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 26 [2018-11-23 13:46:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:46:57,027 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 13:46:57,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:46:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 13:46:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:46:57,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:57,028 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:57,028 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:57,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1107887526, now seen corresponding path program 5 times [2018-11-23 13:46:57,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:57,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:46:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:57,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:46:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:57,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:57,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:46:57,096 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:46:57,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:46:57,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:46:57,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f35cdd04-caad-42e4-a818-49ec9da7ac11/bin-2019/utaipan/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 13:46:57,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:46:57,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 13:46:57,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:46:57,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:46:57,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:46:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:57,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:46:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:46:57,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:46:57,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-23 13:46:57,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:46:57,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:46:57,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:46:57,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:46:57,226 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 20 states. [2018-11-23 13:46:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:46:57,265 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-23 13:46:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:46:57,265 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-11-23 13:46:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:46:57,266 INFO L225 Difference]: With dead ends: 47 [2018-11-23 13:46:57,266 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:46:57,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:46:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:46:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 13:46:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:46:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 13:46:57,269 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 30 [2018-11-23 13:46:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:46:57,269 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 13:46:57,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:46:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 13:46:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:46:57,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:46:57,270 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:46:57,270 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:46:57,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:46:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash -682200363, now seen corresponding path program 6 times [2018-11-23 13:46:57,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:46:57,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:57,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:46:57,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:46:57,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:46:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:46:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:46:57,306 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #39#return; [?] CALL call #t~ret3 := main(); [?] havoc ~i~0;~j~0 := 10;~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_~j~0=10, main_~n~0=6, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=1, main_~j~0=10, main_~n~0=6, main_~sn~0=0] [?] assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~j~0=10, main_~n~0=6, main_~sn~0=2] [?] #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; VAL [main_~i~0=1, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=2, main_~j~0=9, main_~n~0=6, main_~sn~0=2] [?] assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~j~0=9, main_~n~0=6, main_~sn~0=4] [?] #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; VAL [main_~i~0=2, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=3, main_~j~0=8, main_~n~0=6, main_~sn~0=4] [?] assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~j~0=8, main_~n~0=6, main_~sn~0=6] [?] #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; VAL [main_~i~0=3, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=4, main_~j~0=7, main_~n~0=6, main_~sn~0=6] [?] assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~j~0=7, main_~n~0=6, main_~sn~0=8] [?] #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; VAL [main_~i~0=4, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~j~0=6, main_~n~0=6, main_~sn~0=8] [?] assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=5, main_~j~0=6, main_~n~0=6, main_~sn~0=10] [?] #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; VAL [main_~i~0=5, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=6, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=6, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [?] assume !(~i~0 < ~j~0); VAL [main_~i~0=6, main_~j~0=5, main_~n~0=6, main_~sn~0=10] [?] #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; VAL [main_~i~0=6, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=7, main_~j~0=4, main_~n~0=6, main_~sn~0=10] [?] 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~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10; [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, ~j~0=10, ~n~0=6, ~sn~0=0] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=0] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=2] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=1, ~j~0=9, ~n~0=6, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=4] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=2, ~j~0=8, ~n~0=6, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=6] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=3, ~j~0=7, ~n~0=6, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=8] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=4, ~j~0=6, ~n~0=6, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=5, ~j~0=5, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L14-L15] assume !(~i~0 < ~j~0); VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=6, ~j~0=4, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L13-L17] assume !(~i~0 <= ~n~0); VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L18] 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~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10; [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, ~j~0=10, ~n~0=6, ~sn~0=0] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=0] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=2] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=1, ~j~0=9, ~n~0=6, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=4] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=2, ~j~0=8, ~n~0=6, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=6] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=3, ~j~0=7, ~n~0=6, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=8] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=4, ~j~0=6, ~n~0=6, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L14-L15] assume ~i~0 < ~j~0; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=5, ~j~0=5, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L13-L17] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L14-L15] assume !(~i~0 < ~j~0); VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=6, ~j~0=4, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L13-L17] assume !(~i~0 <= ~n~0); VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L18] 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~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10; [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, ~j~0=10, ~n~0=6, ~sn~0=0] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=0] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=2] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=1, ~j~0=9, ~n~0=6, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=4] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=2, ~j~0=8, ~n~0=6, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=6] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=3, ~j~0=7, ~n~0=6, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=8] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=4, ~j~0=6, ~n~0=6, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=5, ~j~0=5, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L14] COND FALSE !(~i~0 < ~j~0) VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=6, ~j~0=4, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L13-L17] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L18] 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~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10; [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, ~j~0=10, ~n~0=6, ~sn~0=0] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=0] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=2] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=1, ~j~0=9, ~n~0=6, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=4] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=2, ~j~0=8, ~n~0=6, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=6] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=3, ~j~0=7, ~n~0=6, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=8] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=4, ~j~0=6, ~n~0=6, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=5, ~j~0=5, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L14] COND FALSE !(~i~0 < ~j~0) VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=6, ~j~0=4, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L13-L17] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L18] 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~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10; [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, ~j~0=10, ~n~0=6, ~sn~0=0] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=0] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=2] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=1, ~j~0=9, ~n~0=6, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=4] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=2, ~j~0=8, ~n~0=6, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=6] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=3, ~j~0=7, ~n~0=6, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=8] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=4, ~j~0=6, ~n~0=6, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=5, ~j~0=5, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L14] COND FALSE !(~i~0 < ~j~0) VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=6, ~j~0=4, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L13-L17] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L18] 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~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10; [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, ~j~0=10, ~n~0=6, ~sn~0=0] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=0] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~j~0=10, ~n~0=6, ~sn~0=2] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=1, ~j~0=9, ~n~0=6, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=2] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~j~0=9, ~n~0=6, ~sn~0=4] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=2, ~j~0=8, ~n~0=6, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=4] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~j~0=8, ~n~0=6, ~sn~0=6] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=3, ~j~0=7, ~n~0=6, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=6] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~j~0=7, ~n~0=6, ~sn~0=8] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=4, ~j~0=6, ~n~0=6, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=8] [L14] COND TRUE ~i~0 < ~j~0 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~j~0=6, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=5, ~j~0=5, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L13-L17] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L14] COND FALSE !(~i~0 < ~j~0) VAL [~i~0=6, ~j~0=5, ~n~0=6, ~sn~0=10] [L16] #t~post2 := ~j~0; [L16] ~j~0 := #t~post2 - 1; [L16] havoc #t~post2; VAL [~i~0=6, ~j~0=4, ~n~0=6, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L13-L17] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=7, ~j~0=4, ~n~0=6, ~sn~0=10] [L18] 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, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, j=10, n=6, n=0] [L13] COND TRUE i<=n VAL [i=1, j=10, n=0, n=6] [L14] COND TRUE i