./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_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_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/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 1b149b3cef099476d14a8b122afb66552d0406eb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 01:05:47,827 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:05:47,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:05:47,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:05:47,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:05:47,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:05:47,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:05:47,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:05:47,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:05:47,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:05:47,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:05:47,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:05:47,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:05:47,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:05:47,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:05:47,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:05:47,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:05:47,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:05:47,844 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:05:47,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:05:47,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:05:47,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:05:47,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:05:47,848 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:05:47,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:05:47,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:05:47,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:05:47,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:05:47,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:05:47,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:05:47,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:05:47,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:05:47,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:05:47,852 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:05:47,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:05:47,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:05:47,853 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 01:05:47,862 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:05:47,863 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:05:47,863 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:05:47,863 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:05:47,863 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:05:47,864 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:05:47,864 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:05:47,864 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:05:47,864 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:05:47,864 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:05:47,864 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:05:47,864 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:05:47,864 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:05:47,865 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:05:47,865 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:05:47,865 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:05:47,865 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:05:47,866 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:05:47,866 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:05:47,866 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:05:47,866 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:05:47,866 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:05:47,866 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:05:47,866 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:05:47,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:05:47,867 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:05:47,867 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:05:47,867 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:05:47,867 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:05:47,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:05:47,867 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:05:47,867 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:05:47,868 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:05:47,868 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:05:47,868 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:05:47,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:05:47,868 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 01:05:47,868 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_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/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 -> 1b149b3cef099476d14a8b122afb66552d0406eb [2018-11-23 01:05:47,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:05:47,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:05:47,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:05:47,904 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:05:47,905 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:05:47,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/../../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-23 01:05:47,949 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/data/d693571d7/7a2ff231d2c14a39bb75ffd4a0f1b210/FLAGf62fc9231 [2018-11-23 01:05:48,265 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:05:48,265 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-23 01:05:48,269 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/data/d693571d7/7a2ff231d2c14a39bb75ffd4a0f1b210/FLAGf62fc9231 [2018-11-23 01:05:48,280 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/data/d693571d7/7a2ff231d2c14a39bb75ffd4a0f1b210 [2018-11-23 01:05:48,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:05:48,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:05:48,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:05:48,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:05:48,287 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:05:48,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:48" (1/1) ... [2018-11-23 01:05:48,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213ccf52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48, skipping insertion in model container [2018-11-23 01:05:48,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:48" (1/1) ... [2018-11-23 01:05:48,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:05:48,315 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:05:48,429 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:05:48,431 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:05:48,440 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:05:48,448 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:05:48,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48 WrapperNode [2018-11-23 01:05:48,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:05:48,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:05:48,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:05:48,449 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:05:48,454 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:05:48" (1/1) ... [2018-11-23 01:05:48,457 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:05:48" (1/1) ... [2018-11-23 01:05:48,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:05:48,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:05:48,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:05:48,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:05:48,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48" (1/1) ... [2018-11-23 01:05:48,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48" (1/1) ... [2018-11-23 01:05:48,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48" (1/1) ... [2018-11-23 01:05:48,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48" (1/1) ... [2018-11-23 01:05:48,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48" (1/1) ... [2018-11-23 01:05:48,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48" (1/1) ... [2018-11-23 01:05:48,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48" (1/1) ... [2018-11-23 01:05:48,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:05:48,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:05:48,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:05:48,473 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:05:48,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/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 01:05:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:05:48,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:05:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:05:48,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:05:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:05:48,548 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:05:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 01:05:48,548 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 01:05:48,646 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:05:48,647 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 01:05:48,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:48 BoogieIcfgContainer [2018-11-23 01:05:48,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:05:48,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:05:48,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:05:48,650 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:05:48,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:05:48" (1/3) ... [2018-11-23 01:05:48,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26479d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:05:48, skipping insertion in model container [2018-11-23 01:05:48,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:48" (2/3) ... [2018-11-23 01:05:48,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26479d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:05:48, skipping insertion in model container [2018-11-23 01:05:48,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:48" (3/3) ... [2018-11-23 01:05:48,653 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-23 01:05:48,659 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:05:48,664 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:05:48,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:05:48,700 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:05:48,701 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:05:48,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:05:48,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:05:48,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:05:48,701 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:05:48,701 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:05:48,701 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:05:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 01:05:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:05:48,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:05:48,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:05:48,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:05:48,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:05:48,720 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 01:05:48,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:05:48,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:48,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:05:48,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:48,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:05:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:05:48,799 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 01:05:48,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:05:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:05:48,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:05:48,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 01:05:48,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:05:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:05:48,813 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 01:05:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:05:48,830 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 01:05:48,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:05:48,831 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 01:05:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:05:48,836 INFO L225 Difference]: With dead ends: 30 [2018-11-23 01:05:48,836 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 01:05:48,838 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 01:05:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 01:05:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 01:05:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 01:05:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 01:05:48,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 01:05:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:05:48,861 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 01:05:48,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 01:05:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 01:05:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:05:48,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:05:48,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:05:48,862 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:05:48,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:05:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2018-11-23 01:05:48,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:05:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:48,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:05:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:48,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:05:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:05:48,931 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 01:05:48,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:05:48,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:05:48,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:05:48,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:05:48,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:05:48,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:05:48,933 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 01:05:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:05:48,959 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 01:05:48,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:05:48,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 01:05:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:05:48,959 INFO L225 Difference]: With dead ends: 19 [2018-11-23 01:05:48,959 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 01:05:48,960 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 01:05:48,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 01:05:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 01:05:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 01:05:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 01:05:48,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 01:05:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:05:48,964 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 01:05:48,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:05:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 01:05:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 01:05:48,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:05:48,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:05:48,965 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:05:48,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:05:48,966 INFO L82 PathProgramCache]: Analyzing trace with hash 137668885, now seen corresponding path program 1 times [2018-11-23 01:05:48,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:05:48,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:48,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:05:48,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:48,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:05:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:05:49,132 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 01:05:49,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:05:49,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:05:49,134 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-23 01:05:49,135 INFO L202 CegarAbsIntRunner]: [0], [4], [10], [12], [17], [19], [25], [28], [30], [36], [37], [38], [40] [2018-11-23 01:05:49,157 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:05:49,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:05:49,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:05:49,277 INFO L272 AbstractInterpreter]: Visited 13 different actions 36 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 93 root evaluator evaluations with a maximum evaluation depth of 6. Performed 93 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-23 01:05:49,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:05:49,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:05:49,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:05:49,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/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 01:05:49,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:05:49,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:05:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:05:49,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:05:49,387 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 01:05:49,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:05:49,488 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 01:05:49,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:05:49,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2018-11-23 01:05:49,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:05:49,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:05:49,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:05:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-23 01:05:49,516 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 12 states. [2018-11-23 01:05:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:05:49,616 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 01:05:49,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:05:49,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-11-23 01:05:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:05:49,617 INFO L225 Difference]: With dead ends: 32 [2018-11-23 01:05:49,617 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 01:05:49,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-11-23 01:05:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 01:05:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 01:05:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 01:05:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 01:05:49,622 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 01:05:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:05:49,622 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 01:05:49,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:05:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 01:05:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:05:49,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:05:49,623 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:05:49,623 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:05:49,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:05:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2110192267, now seen corresponding path program 1 times [2018-11-23 01:05:49,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:05:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:49,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:05:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:49,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:05:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:05:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:05:49,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:05:49,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:05:49,656 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-23 01:05:49,657 INFO L202 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [17], [19], [25], [28], [30], [36], [37], [38], [40] [2018-11-23 01:05:49,657 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:05:49,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:05:49,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:05:49,698 INFO L272 AbstractInterpreter]: Visited 14 different actions 40 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 108 root evaluator evaluations with a maximum evaluation depth of 6. Performed 108 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-23 01:05:49,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:05:49,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:05:49,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:05:49,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/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 01:05:49,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:05:49,719 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:05:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:05:49,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:05:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:05:49,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:05:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:05:49,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:05:49,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2018-11-23 01:05:49,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:05:49,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:05:49,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:05:49,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:05:49,775 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 4 states. [2018-11-23 01:05:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:05:49,791 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 01:05:49,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:05:49,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 01:05:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:05:49,793 INFO L225 Difference]: With dead ends: 28 [2018-11-23 01:05:49,793 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 01:05:49,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:05:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 01:05:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 01:05:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 01:05:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 01:05:49,796 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-11-23 01:05:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:05:49,796 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 01:05:49,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:05:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 01:05:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 01:05:49,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:05:49,797 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:05:49,797 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:05:49,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:05:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash 370288085, now seen corresponding path program 2 times [2018-11-23 01:05:49,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:05:49,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:49,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:05:49,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:49,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:05:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:05:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 01:05:49,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:05:49,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:05:49,905 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 01:05:49,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 01:05:49,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:05:49,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/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 01:05:49,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 01:05:49,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 01:05:49,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 01:05:49,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:05:49,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:05:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:05:50,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:05:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:05:50,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:05:50,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 27 [2018-11-23 01:05:50,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:05:50,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 01:05:50,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 01:05:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-11-23 01:05:50,217 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2018-11-23 01:05:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:05:50,476 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-23 01:05:50,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 01:05:50,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-23 01:05:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:05:50,477 INFO L225 Difference]: With dead ends: 38 [2018-11-23 01:05:50,477 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 01:05:50,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 01:05:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 01:05:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 01:05:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 01:05:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 01:05:50,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2018-11-23 01:05:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:05:50,481 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 01:05:50,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 01:05:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 01:05:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 01:05:50,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:05:50,482 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:05:50,483 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:05:50,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:05:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash 66146485, now seen corresponding path program 2 times [2018-11-23 01:05:50,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:05:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:50,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:05:50,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:05:50,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:05:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:05:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:05:50,511 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] assume !(4 == ~i~0); VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] assume !(4 == ~i~0); VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] assume !(4 == ~i~0); VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=8] [?] assume 4 == ~i~0;~sn~0 := -10; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=(- 10)] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=4, 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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=4, n=2] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=6, n=4] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=4, n=8] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=4, n=-10] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 01:05:50,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:05:50 BoogieIcfgContainer [2018-11-23 01:05:50,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:05:50,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:05:50,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:05:50,536 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:05:50,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:48" (3/4) ... [2018-11-23 01:05:50,539 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] assume !(4 == ~i~0); VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] assume !(4 == ~i~0); VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] assume !(4 == ~i~0); VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=8] [?] assume 4 == ~i~0;~sn~0 := -10; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=(- 10)] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=4, 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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=4, n=0] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=2, n=4] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=2, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=4, n=6] [L15] COND FALSE !(i==4) VAL [i=3, n=4, n=6] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=4, n=8] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=4, n=-10] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=4, n=-10] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 01:05:50,579 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_68e2f174-4ef2-4c05-ae81-fef3bf577ae4/bin-2019/utaipan/witness.graphml [2018-11-23 01:05:50,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:05:50,580 INFO L168 Benchmark]: Toolchain (without parser) took 2297.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:05:50,581 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:05:50,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.23 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:05:50,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.74 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:05:50,582 INFO L168 Benchmark]: Boogie Preprocessor took 12.12 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:05:50,582 INFO L168 Benchmark]: RCFGBuilder took 173.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:05:50,583 INFO L168 Benchmark]: TraceAbstraction took 1888.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:05:50,583 INFO L168 Benchmark]: Witness Printer took 43.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:05:50,585 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.23 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.74 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.12 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 173.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1888.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Witness Printer took 43.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=4, n=2] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=6, n=4] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=4, n=8] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=4, n=-10] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 1.8s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 17 SDslu, 153 SDs, 0 SdLazy, 224 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 153 ConstructedInterpolants, 8 QuantifiedInterpolants, 13173 SizeOfPredicates, 9 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 14/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...