./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test22-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:53:48,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:53:48,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:53:48,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:53:48,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:53:48,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:53:48,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:53:48,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:53:48,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:53:48,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:53:48,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:53:48,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:53:48,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:53:48,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:53:48,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:53:48,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:53:48,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:53:48,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:53:48,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:53:48,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:53:48,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:53:48,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:53:48,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:53:48,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:53:48,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:53:48,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:53:48,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:53:48,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:53:48,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:53:48,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:53:48,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:53:48,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:53:48,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:53:48,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:53:48,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:53:48,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:53:48,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:53:48,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:53:48,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:53:48,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:53:48,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:53:48,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:53:48,975 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:53:48,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:53:48,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:53:48,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:53:48,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:53:48,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:53:48,978 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:53:48,978 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:53:48,978 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:53:48,979 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:53:48,979 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:53:48,979 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:53:48,980 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:53:48,980 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:53:48,980 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:53:48,981 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:53:48,981 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:53:48,981 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:53:48,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:53:48,982 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:53:48,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:53:48,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:53:48,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:53:48,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:53:48,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:53:48,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:53:48,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:53:48,985 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:53:48,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:53:48,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:53:48,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:53:48,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:53:48,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:53:48,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:53:48,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:53:48,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:53:48,987 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:53:48,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:53:48,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:53:48,988 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:53:48,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:53:48,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:53:48,989 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:53:48,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur 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 ! overflow) ) 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 -> e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f [2022-11-26 00:53:49,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:53:49,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:53:49,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:53:49,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:53:49,254 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:53:49,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/ldv-regression/test22-1.c [2022-11-26 00:53:52,421 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:53:52,677 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:53:52,677 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/sv-benchmarks/c/ldv-regression/test22-1.c [2022-11-26 00:53:52,684 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/data/705826d54/be28dc3fe54f4a8fa3d2ded1b421fd41/FLAGc9ec35fbf [2022-11-26 00:53:52,711 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/data/705826d54/be28dc3fe54f4a8fa3d2ded1b421fd41 [2022-11-26 00:53:52,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:53:52,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:53:52,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:53:52,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:53:52,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:53:52,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:53:52" (1/1) ... [2022-11-26 00:53:52,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d31a219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:52, skipping insertion in model container [2022-11-26 00:53:52,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:53:52" (1/1) ... [2022-11-26 00:53:52,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:53:52,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:53:53,016 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2022-11-26 00:53:53,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:53:53,029 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:53:53,047 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2022-11-26 00:53:53,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:53:53,064 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:53:53,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53 WrapperNode [2022-11-26 00:53:53,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:53:53,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:53:53,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:53:53,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:53:53,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,109 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-11-26 00:53:53,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:53:53,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:53:53,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:53:53,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:53:53,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,137 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:53:53,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:53:53,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:53:53,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:53:53,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (1/1) ... [2022-11-26 00:53:53,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:53:53,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:53,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:53:53,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:53:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:53:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:53:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:53:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-11-26 00:53:53,227 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-11-26 00:53:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:53:53,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:53:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:53:53,321 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:53:53,324 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:53:53,576 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:53:53,655 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:53:53,655 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-26 00:53:53,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:53:53 BoogieIcfgContainer [2022-11-26 00:53:53,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:53:53,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:53:53,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:53:53,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:53:53,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:53:52" (1/3) ... [2022-11-26 00:53:53,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c197a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:53:53, skipping insertion in model container [2022-11-26 00:53:53,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:53" (2/3) ... [2022-11-26 00:53:53,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c197a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:53:53, skipping insertion in model container [2022-11-26 00:53:53,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:53:53" (3/3) ... [2022-11-26 00:53:53,674 INFO L112 eAbstractionObserver]: Analyzing ICFG test22-1.c [2022-11-26 00:53:53,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:53:53,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-26 00:53:53,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:53:53,776 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e54e6ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:53:53,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-26 00:53:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:53:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:53:53,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:53,793 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:53,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:53:53,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:53,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1545319897, now seen corresponding path program 1 times [2022-11-26 00:53:53,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:53,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768524409] [2022-11-26 00:53:53,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:53,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:53:54,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:54,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768524409] [2022-11-26 00:53:54,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768524409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:54,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:54,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:53:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202014228] [2022-11-26 00:53:54,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:54,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:53:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:53:54,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:53:54,584 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:53:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:54,657 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-11-26 00:53:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:53:54,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 15 [2022-11-26 00:53:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:54,668 INFO L225 Difference]: With dead ends: 33 [2022-11-26 00:53:54,668 INFO L226 Difference]: Without dead ends: 19 [2022-11-26 00:53:54,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:54,676 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:54,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:53:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-26 00:53:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-26 00:53:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:53:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-26 00:53:54,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-11-26 00:53:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:54,725 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-26 00:53:54,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:53:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-26 00:53:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 00:53:54,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:54,727 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:54,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:53:54,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:53:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash 660276606, now seen corresponding path program 1 times [2022-11-26 00:53:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:54,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131702940] [2022-11-26 00:53:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:54,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:53:55,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:55,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131702940] [2022-11-26 00:53:55,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131702940] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:55,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039084230] [2022-11-26 00:53:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:55,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:55,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:55,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:55,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:53:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:56,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-26 00:53:56,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:56,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:56,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:56,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-26 00:53:56,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:56,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-26 00:53:56,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:56,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-11-26 00:53:56,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:56,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-11-26 00:53:57,609 INFO L321 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2022-11-26 00:53:57,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 67 [2022-11-26 00:53:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:53:57,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:53:58,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039084230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:53:58,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [375685009] [2022-11-26 00:53:58,430 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-26 00:53:58,436 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:53:58,440 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:53:58,445 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:53:58,445 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:53:58,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:58,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:58,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2022-11-26 00:54:00,042 INFO L197 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 77 for LOIs [2022-11-26 00:54:00,063 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:54:03,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [375685009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:03,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:03,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 7, 7] total 30 [2022-11-26 00:54:03,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324841462] [2022-11-26 00:54:03,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:03,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:54:03,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:03,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:54:03,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:54:03,921 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:54:04,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:04,247 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-26 00:54:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:54:04,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 16 [2022-11-26 00:54:04,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:04,248 INFO L225 Difference]: With dead ends: 19 [2022-11-26 00:54:04,248 INFO L226 Difference]: Without dead ends: 18 [2022-11-26 00:54:04,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:54:04,250 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:04,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:54:04,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-26 00:54:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-26 00:54:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:54:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-26 00:54:04,259 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-11-26 00:54:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:04,259 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-26 00:54:04,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:54:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-26 00:54:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:54:04,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:04,260 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:04,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:54:04,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:04,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:54:04,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:04,467 INFO L85 PathProgramCache]: Analyzing trace with hash -649786592, now seen corresponding path program 1 times [2022-11-26 00:54:04,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:04,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159512419] [2022-11-26 00:54:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:54:04,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:04,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159512419] [2022-11-26 00:54:04,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159512419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:04,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:54:04,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:54:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377207764] [2022-11-26 00:54:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:04,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:54:04,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:54:04,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:54:04,545 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:54:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:04,590 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-11-26 00:54:04,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:54:04,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2022-11-26 00:54:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:04,592 INFO L225 Difference]: With dead ends: 18 [2022-11-26 00:54:04,592 INFO L226 Difference]: Without dead ends: 17 [2022-11-26 00:54:04,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:54:04,596 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:04,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:54:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-26 00:54:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-26 00:54:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:54:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-26 00:54:04,617 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 19 [2022-11-26 00:54:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:04,618 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-26 00:54:04,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:54:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-26 00:54:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:54:04,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:04,620 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:04,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:54:04,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:54:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1331452197, now seen corresponding path program 1 times [2022-11-26 00:54:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:04,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145260617] [2022-11-26 00:54:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:54:05,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:05,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145260617] [2022-11-26 00:54:05,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145260617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:05,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108088561] [2022-11-26 00:54:05,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:05,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:05,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:05,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:05,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:54:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:05,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-26 00:54:05,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:05,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:05,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-26 00:54:05,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-26 00:54:05,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:05,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-11-26 00:54:05,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:05,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-11-26 00:54:05,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:54:05,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:54:05,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2022-11-26 00:54:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:54:05,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:54:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:54:06,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108088561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:54:06,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [844458469] [2022-11-26 00:54:06,621 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-26 00:54:06,621 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:54:06,621 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:54:06,622 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:54:06,622 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:54:06,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:06,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:06,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2022-11-26 00:54:08,123 INFO L197 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 77 for LOIs [2022-11-26 00:54:08,139 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:54:13,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [844458469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:13,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:13,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9, 8, 10] total 36 [2022-11-26 00:54:13,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770459938] [2022-11-26 00:54:13,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:13,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:54:13,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:13,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:54:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 00:54:13,453 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:54:13,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:13,922 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-11-26 00:54:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:54:13,923 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2022-11-26 00:54:13,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:13,924 INFO L225 Difference]: With dead ends: 22 [2022-11-26 00:54:13,924 INFO L226 Difference]: Without dead ends: 21 [2022-11-26 00:54:13,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 00:54:13,926 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:13,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 9 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:54:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-26 00:54:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-26 00:54:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:54:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-26 00:54:13,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2022-11-26 00:54:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:13,941 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-26 00:54:13,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:54:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-26 00:54:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:54:13,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:13,943 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:13,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:54:14,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:14,151 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:54:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash 699236684, now seen corresponding path program 1 times [2022-11-26 00:54:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:14,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889659579] [2022-11-26 00:54:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:54:14,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:14,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889659579] [2022-11-26 00:54:14,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889659579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:14,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548447031] [2022-11-26 00:54:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:14,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:14,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:54:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:14,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-26 00:54:14,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:14,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:14,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:14,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-26 00:54:14,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:14,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-26 00:54:14,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:14,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-11-26 00:54:14,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:14,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-11-26 00:54:15,775 INFO L321 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2022-11-26 00:54:15,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 61 [2022-11-26 00:54:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:54:15,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:54:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:54:16,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548447031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:54:16,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1578324634] [2022-11-26 00:54:16,786 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-26 00:54:16,786 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:54:16,787 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:54:16,787 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:54:16,787 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:54:16,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:16,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:54:16,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2022-11-26 00:54:18,443 INFO L197 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 77 for LOIs [2022-11-26 00:54:18,463 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:54:22,204 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '695#(and (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |~#d2~0.base|) (< 2147483646 |ULTIMATE.start_main_~i~0#1|) (= |~#d1~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:54:22,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:54:22,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:22,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2022-11-26 00:54:22,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333010018] [2022-11-26 00:54:22,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:54:22,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-26 00:54:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-26 00:54:22,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1406, Unknown=0, NotChecked=0, Total=1640 [2022-11-26 00:54:22,208 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 29 states, 22 states have (on average 2.227272727272727) internal successors, (49), 25 states have internal predecessors, (49), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-26 00:54:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:24,531 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-11-26 00:54:24,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:54:24,532 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.227272727272727) internal successors, (49), 25 states have internal predecessors, (49), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2022-11-26 00:54:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:24,532 INFO L225 Difference]: With dead ends: 31 [2022-11-26 00:54:24,532 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:54:24,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=555, Invalid=2637, Unknown=0, NotChecked=0, Total=3192 [2022-11-26 00:54:24,535 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 154 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:24,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 28 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:54:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:54:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:54:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:54:24,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-11-26 00:54:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:24,537 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:54:24,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.227272727272727) internal successors, (49), 25 states have internal predecessors, (49), 7 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-26 00:54:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:54:24,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:54:24,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-26 00:54:24,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-26 00:54:24,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-26 00:54:24,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-26 00:54:24,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:54:24,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:24,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:54:25,807 INFO L902 garLoopResultBuilder]: At program point get_dummyENTRY(lines 22 25) the Hoare annotation is: true [2022-11-26 00:54:25,808 INFO L899 garLoopResultBuilder]: For program point get_dummyEXIT(lines 22 25) no Hoare annotation was computed. [2022-11-26 00:54:25,808 INFO L895 garLoopResultBuilder]: At program point L35-2(line 35) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |~#d1~0.base|)) (.cse7 (select |#memory_int| |~#d2~0.base|))) (let ((.cse0 (select .cse7 |~#d2~0.offset|)) (.cse1 (select .cse6 |~#d1~0.offset|)) (.cse4 (select .cse7 (+ |~#d2~0.offset| 4))) (.cse3 (select .cse6 (+ |~#d1~0.offset| 4))) (.cse5 (select |#memory_int| 1))) (and (<= 0 (+ .cse0 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (<= .cse0 2147483647) (= 5 |~#d2~0.base|) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= .cse1 2147483647) (= (select |#valid| 3) 1) (exists ((|v_get_dummy_#t~nondet8_23| Int)) (let ((.cse2 (not (= (mod |v_get_dummy_#t~nondet8_23| 256) 0)))) (and (= (ite .cse2 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd1~0#1.base|) (= (ite .cse2 |~#d1~0.offset| |~#d2~0.offset|) |ULTIMATE.start_main_~pd1~0#1.offset|)))) (<= 0 (+ 2147483648 .cse1)) (= (select |#length| 4) 8) (<= 0 (+ .cse3 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse4 2147483648)) (<= .cse4 2147483647) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse3 2147483647) (= (select .cse5 0) 48) (= (select .cse5 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-26 00:54:25,808 INFO L899 garLoopResultBuilder]: For program point L35-3(line 35) no Hoare annotation was computed. [2022-11-26 00:54:25,809 INFO L895 garLoopResultBuilder]: At program point L35-4(line 35) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |~#d1~0.base|)) (.cse8 (select |#memory_int| |~#d2~0.base|))) (let ((.cse0 (select .cse8 |~#d2~0.offset|)) (.cse1 (select .cse7 |~#d1~0.offset|)) (.cse3 (select .cse8 (+ |~#d2~0.offset| 4))) (.cse2 (select .cse7 (+ |~#d1~0.offset| 4))) (.cse6 (select |#memory_int| 1))) (and (<= 0 (+ .cse0 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (<= .cse0 2147483647) (= 5 |~#d2~0.base|) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= .cse1 2147483647) (= (select |#valid| 3) 1) (<= 0 (+ 2147483648 .cse1)) (= (select |#length| 4) 8) (<= 0 (+ .cse2 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse3 2147483648)) (<= .cse3 2147483647) (= (select |#valid| 1) 1) (exists ((|v_get_dummy_#t~nondet8_24| Int)) (let ((.cse4 (not (= (mod |v_get_dummy_#t~nondet8_24| 256) 0)))) (and (= (ite .cse4 |~#d1~0.offset| |~#d2~0.offset|) |ULTIMATE.start_main_~pd1~0#1.offset|) (= (ite .cse4 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd1~0#1.base|)))) (exists ((|v_get_dummy_#t~nondet8_23| Int)) (let ((.cse5 (not (= (mod |v_get_dummy_#t~nondet8_23| 256) 0)))) (and (= (ite .cse5 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd2~0#1.base|) (= (ite .cse5 |~#d1~0.offset| |~#d2~0.offset|) |ULTIMATE.start_main_~pd2~0#1.offset|)))) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse2 2147483647) (= (select .cse6 0) 48) (= (select .cse6 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-26 00:54:25,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-26 00:54:25,810 INFO L899 garLoopResultBuilder]: For program point L35-5(line 35) no Hoare annotation was computed. [2022-11-26 00:54:25,810 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2022-11-26 00:54:25,811 INFO L895 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |~#d1~0.base|)) (.cse8 (select |#memory_int| |~#d2~0.base|))) (let ((.cse0 (select .cse8 |~#d2~0.offset|)) (.cse1 (select .cse7 |~#d1~0.offset|)) (.cse3 (select .cse8 (+ |~#d2~0.offset| 4))) (.cse2 (select .cse7 (+ |~#d1~0.offset| 4))) (.cse6 (select |#memory_int| 1))) (and (<= 0 (+ .cse0 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (<= .cse0 2147483647) (= 5 |~#d2~0.base|) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= .cse1 2147483647) (= (select |#valid| 3) 1) (<= 0 (+ 2147483648 .cse1)) (= (select |#length| 4) 8) (<= 0 (+ .cse2 2147483648)) (= (select |#valid| 4) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~pa~0#1.base|) |ULTIMATE.start_main_~pa~0#1.offset|) 2147483647) (<= 0 (+ .cse3 2147483648)) (<= .cse3 2147483647) (= (select |#valid| 1) 1) (exists ((|v_get_dummy_#t~nondet8_24| Int)) (let ((.cse4 (not (= (mod |v_get_dummy_#t~nondet8_24| 256) 0)))) (and (= (ite .cse4 |~#d1~0.offset| |~#d2~0.offset|) |ULTIMATE.start_main_~pd1~0#1.offset|) (= (ite .cse4 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd1~0#1.base|)))) (exists ((|v_get_dummy_#t~nondet8_23| Int)) (let ((.cse5 (not (= (mod |v_get_dummy_#t~nondet8_23| 256) 0)))) (and (= (ite .cse5 |~#d1~0.base| |~#d2~0.base|) |ULTIMATE.start_main_~pd2~0#1.base|) (= (ite .cse5 |~#d1~0.offset| |~#d2~0.offset|) |ULTIMATE.start_main_~pd2~0#1.offset|)))) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (or (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|)) (not |ULTIMATE.start_main_#t~short15#1|)) (= 8 (select |#length| 5)) (<= .cse2 2147483647) (= (select .cse6 0) 48) (= (select .cse6 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-26 00:54:25,811 INFO L895 garLoopResultBuilder]: At program point L40-4(lines 40 42) the Hoare annotation is: (or (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|)) (not |ULTIMATE.start_main_#t~short15#1|)) [2022-11-26 00:54:25,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-26 00:54:25,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:54:25,812 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-11-26 00:54:25,812 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-11-26 00:54:25,812 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 46) no Hoare annotation was computed. [2022-11-26 00:54:25,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-26 00:54:25,812 INFO L899 garLoopResultBuilder]: For program point L37-4(lines 37 46) no Hoare annotation was computed. [2022-11-26 00:54:25,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:54:25,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2022-11-26 00:54:25,813 INFO L902 garLoopResultBuilder]: At program point L51(lines 32 52) the Hoare annotation is: true [2022-11-26 00:54:25,813 INFO L895 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: (or (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|)) (not |ULTIMATE.start_main_#t~short15#1|)) [2022-11-26 00:54:25,813 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-11-26 00:54:25,813 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-11-26 00:54:25,814 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |~#d1~0.base|)) (.cse6 (select |#memory_int| |~#d2~0.base|))) (let ((.cse0 (select .cse6 |~#d2~0.offset|)) (.cse1 (select .cse5 |~#d1~0.offset|)) (.cse3 (select .cse6 (+ |~#d2~0.offset| 4))) (.cse2 (select .cse5 (+ |~#d1~0.offset| 4))) (.cse4 (select |#memory_int| 1))) (and (<= 0 (+ .cse0 2147483648)) (= 1 (select |#valid| 5)) (= (select |#length| 3) 12) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (<= .cse0 2147483647) (= 5 |~#d2~0.base|) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (<= .cse1 2147483647) (= (select |#valid| 3) 1) (<= 0 (+ 2147483648 .cse1)) (= (select |#length| 4) 8) (<= 0 (+ .cse2 2147483648)) (= (select |#valid| 4) 1) (<= 0 (+ .cse3 2147483648)) (<= .cse3 2147483647) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= |~#d1~0.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= 8 (select |#length| 5)) (<= .cse2 2147483647) (= (select .cse4 0) 48) (= (select .cse4 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-26 00:54:25,814 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-11-26 00:54:25,818 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-26 00:54:25,820 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:54:25,831 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] [2022-11-26 00:54:25,832 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] [2022-11-26 00:54:25,832 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] [2022-11-26 00:54:25,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] [2022-11-26 00:54:25,844 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] [2022-11-26 00:54:25,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] [2022-11-26 00:54:25,859 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] [2022-11-26 00:54:25,860 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] [2022-11-26 00:54:25,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:54:25 BoogieIcfgContainer [2022-11-26 00:54:25,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:54:25,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:54:25,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:54:25,865 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:54:25,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:53:53" (3/4) ... [2022-11-26 00:54:25,870 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:54:25,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2022-11-26 00:54:25,880 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-26 00:54:25,881 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-26 00:54:25,881 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:54:25,881 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:54:25,913 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[d2][d2] + 2147483648 && 1 == \valid[5]) && unknown-#length-unknown[3] == 12) && d2 == 0) && d1 == 4) && unknown-#memory_int-unknown[d2][d2] <= 2147483647) && 5 == d2) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && 0 <= i + 2147483648) && unknown-#memory_int-unknown[d1][d1] <= 2147483647) && \valid[3] == 1) && 0 <= 2147483648 + unknown-#memory_int-unknown[d1][d1]) && unknown-#length-unknown[4] == 8) && 0 <= unknown-#memory_int-unknown[d1][d1 + 4] + 2147483648) && \valid[4] == 1) && unknown-#memory_int-unknown[pa][pa] <= 2147483647) && 0 <= unknown-#memory_int-unknown[d2][d2 + 4] + 2147483648) && unknown-#memory_int-unknown[d2][d2 + 4] <= 2147483647) && \valid[1] == 1) && (\exists v_get_dummy_#t~nondet8_24 : int :: (if !(v_get_dummy_#t~nondet8_24 % 256 == 0) then d1 else d2) == pd1 && (if !(v_get_dummy_#t~nondet8_24 % 256 == 0) then d1 else d2) == pd1)) && (\exists v_get_dummy_#t~nondet8_23 : int :: (if !(v_get_dummy_#t~nondet8_23 % 256 == 0) then d1 else d2) == pd2 && (if !(v_get_dummy_#t~nondet8_23 % 256 == 0) then d1 else d2) == pd2)) && \valid[0] == 0) && d1 == 0) && \valid[2] == 1) && #NULL == 0) && (1 <= unknown-#memory_int-unknown[pd2][pd2] || !aux-pd1 != 0 && pd1 == pd2 && (*pd2).a > 0-aux)) && 8 == unknown-#length-unknown[5]) && unknown-#memory_int-unknown[d1][d1 + 4] <= 2147483647) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 [2022-11-26 00:54:25,927 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:54:25,927 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:54:25,928 INFO L158 Benchmark]: Toolchain (without parser) took 33205.99ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 133.3MB in the beginning and 204.1MB in the end (delta: -70.9MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2022-11-26 00:54:25,928 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 113.2MB. Free memory was 65.2MB in the beginning and 64.9MB in the end (delta: 321.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:54:25,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.94ms. Allocated memory is still 163.6MB. Free memory was 133.3MB in the beginning and 122.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-26 00:54:25,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.40ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 120.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:54:25,929 INFO L158 Benchmark]: Boogie Preprocessor took 30.40ms. Allocated memory is still 163.6MB. Free memory was 120.8MB in the beginning and 119.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:54:25,930 INFO L158 Benchmark]: RCFGBuilder took 517.65ms. Allocated memory is still 163.6MB. Free memory was 119.7MB in the beginning and 104.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-26 00:54:25,930 INFO L158 Benchmark]: TraceAbstraction took 32202.29ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 102.9MB in the beginning and 207.3MB in the end (delta: -104.4MB). Peak memory consumption was 175.4MB. Max. memory is 16.1GB. [2022-11-26 00:54:25,931 INFO L158 Benchmark]: Witness Printer took 62.28ms. Allocated memory is still 343.9MB. Free memory was 207.3MB in the beginning and 204.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:54:25,933 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 113.2MB. Free memory was 65.2MB in the beginning and 64.9MB in the end (delta: 321.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.94ms. Allocated memory is still 163.6MB. Free memory was 133.3MB in the beginning and 122.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.40ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 120.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.40ms. Allocated memory is still 163.6MB. Free memory was 120.8MB in the beginning and 119.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.65ms. Allocated memory is still 163.6MB. Free memory was 119.7MB in the beginning and 104.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32202.29ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 102.9MB in the beginning and 207.3MB in the end (delta: -104.4MB). Peak memory consumption was 175.4MB. Max. memory is 16.1GB. * Witness Printer took 62.28ms. Allocated memory is still 343.9MB. Free memory was 207.3MB in the beginning and 204.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 32.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 502 IncrementalHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 46 mSDtfsCounter, 502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 17.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 10 PreInvPairs, 18 NumberOfFragments, 816 HoareAnnotationTreeSize, 10 FomulaSimplifications, 69 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1900 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 203 ConstructedInterpolants, 12 QuantifiedInterpolants, 2869 SizeOfPredicates, 43 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 46/78 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 3.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 32, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 22, TOOLS_POST_TIME: 1.9s, TOOLS_POST_CALL_APPLICATIONS: 18, TOOLS_POST_CALL_TIME: 0.2s, TOOLS_POST_RETURN_APPLICATIONS: 12, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 52, TOOLS_QUANTIFIERELIM_TIME: 2.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 78, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 16, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 32, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 12, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 358, DAG_COMPRESSION_RETAINED_NODES: 84, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant [2022-11-26 00:54:25,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] [2022-11-26 00:54:25,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] [2022-11-26 00:54:25,946 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] [2022-11-26 00:54:25,947 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] [2022-11-26 00:54:25,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] [2022-11-26 00:54:25,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_24,QUANTIFIED] [2022-11-26 00:54:25,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] [2022-11-26 00:54:25,950 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_get_dummy_#t~nondet8_23,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[d2][d2] + 2147483648 && 1 == \valid[5]) && unknown-#length-unknown[3] == 12) && d2 == 0) && d1 == 4) && unknown-#memory_int-unknown[d2][d2] <= 2147483647) && 5 == d2) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && 0 <= i + 2147483648) && unknown-#memory_int-unknown[d1][d1] <= 2147483647) && \valid[3] == 1) && 0 <= 2147483648 + unknown-#memory_int-unknown[d1][d1]) && unknown-#length-unknown[4] == 8) && 0 <= unknown-#memory_int-unknown[d1][d1 + 4] + 2147483648) && \valid[4] == 1) && unknown-#memory_int-unknown[pa][pa] <= 2147483647) && 0 <= unknown-#memory_int-unknown[d2][d2 + 4] + 2147483648) && unknown-#memory_int-unknown[d2][d2 + 4] <= 2147483647) && \valid[1] == 1) && (\exists v_get_dummy_#t~nondet8_24 : int :: (if !(v_get_dummy_#t~nondet8_24 % 256 == 0) then d1 else d2) == pd1 && (if !(v_get_dummy_#t~nondet8_24 % 256 == 0) then d1 else d2) == pd1)) && (\exists v_get_dummy_#t~nondet8_23 : int :: (if !(v_get_dummy_#t~nondet8_23 % 256 == 0) then d1 else d2) == pd2 && (if !(v_get_dummy_#t~nondet8_23 % 256 == 0) then d1 else d2) == pd2)) && \valid[0] == 0) && d1 == 0) && \valid[2] == 1) && #NULL == 0) && (1 <= unknown-#memory_int-unknown[pd2][pd2] || !aux-pd1 != 0 && pd1 == pd2 && (*pd2).a > 0-aux)) && 8 == unknown-#length-unknown[5]) && unknown-#memory_int-unknown[d1][d1 + 4] <= 2147483647) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: 1 <= unknown-#memory_int-unknown[pd2][pd2] || !aux-pd1 != 0 && pd1 == pd2 && (*pd2).a > 0-aux - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 1 <= unknown-#memory_int-unknown[pd2][pd2] || !aux-pd1 != 0 && pd1 == pd2 && (*pd2).a > 0-aux RESULT: Ultimate proved your program to be correct! [2022-11-26 00:54:25,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96a23957-fb1f-46db-9554-a18064a4a251/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE