./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh --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 bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- 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-2329fc7 [2022-12-14 06:49:53,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:49:53,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:49:53,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:49:53,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:49:53,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:49:53,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:49:53,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:49:53,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:49:53,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:49:53,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:49:53,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:49:53,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:49:53,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:49:53,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:49:53,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:49:53,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:49:53,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:49:53,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:49:53,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:49:53,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:49:53,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:49:53,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:49:53,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:49:53,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:49:53,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:49:53,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:49:53,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:49:53,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:49:53,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:49:53,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:49:53,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:49:53,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:49:53,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:49:53,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:49:53,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:49:53,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:49:53,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:49:53,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:49:53,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:49:53,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:49:53,689 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 06:49:53,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:49:53,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:49:53,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:49:53,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:49:53,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:49:53,706 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:49:53,706 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:49:53,706 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:49:53,706 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:49:53,706 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:49:53,706 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:49:53,706 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:49:53,707 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:49:53,707 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:49:53,707 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:49:53,707 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:49:53,707 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:49:53,707 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:49:53,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:49:53,708 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:49:53,708 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 06:49:53,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:49:53,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:49:53,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:49:53,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:49:53,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:49:53,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:49:53,709 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 06:49:53,709 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:49:53,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:49:53,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:49:53,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:49:53,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:49:53,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:49:53,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:49:53,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:49:53,710 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:49:53,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:49:53,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:49:53,710 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:49:53,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:49:53,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:49:53,711 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:49:53,711 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_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/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_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2022-12-14 06:49:53,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:49:53,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:49:53,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:49:53,909 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:49:53,909 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:49:53,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-12-14 06:49:56,491 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:49:56,701 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:49:56,702 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2022-12-14 06:49:56,714 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/data/8089fc70d/19652460fed14875b41088cf7353e3c2/FLAGcd031f43b [2022-12-14 06:49:56,725 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/data/8089fc70d/19652460fed14875b41088cf7353e3c2 [2022-12-14 06:49:56,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:49:56,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:49:56,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:49:56,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:49:56,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:49:56,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:49:56" (1/1) ... [2022-12-14 06:49:56,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d23408b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:56, skipping insertion in model container [2022-12-14 06:49:56,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:49:56" (1/1) ... [2022-12-14 06:49:56,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:49:56,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:49:57,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:49:57,099 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:49:57,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:49:57,187 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:49:57,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57 WrapperNode [2022-12-14 06:49:57,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:49:57,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:49:57,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:49:57,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:49:57,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,233 INFO L138 Inliner]: procedures = 166, calls = 80, calls flagged for inlining = 24, calls inlined = 6, statements flattened = 102 [2022-12-14 06:49:57,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:49:57,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:49:57,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:49:57,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:49:57,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,259 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:49:57,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:49:57,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:49:57,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:49:57,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (1/1) ... [2022-12-14 06:49:57,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:49:57,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:49:57,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:49:57,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:49:57,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-14 06:49:57,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-14 06:49:57,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 06:49:57,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:49:57,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 06:49:57,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 06:49:57,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 06:49:57,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 06:49:57,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:49:57,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:49:57,424 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:49:57,426 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:49:57,582 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:49:57,637 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:49:57,637 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 06:49:57,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:49:57 BoogieIcfgContainer [2022-12-14 06:49:57,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:49:57,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:49:57,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:49:57,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:49:57,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:49:56" (1/3) ... [2022-12-14 06:49:57,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8249a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:49:57, skipping insertion in model container [2022-12-14 06:49:57,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:49:57" (2/3) ... [2022-12-14 06:49:57,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8249a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:49:57, skipping insertion in model container [2022-12-14 06:49:57,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:49:57" (3/3) ... [2022-12-14 06:49:57,648 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2022-12-14 06:49:57,666 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:49:57,667 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-12-14 06:49:57,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:49:57,716 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;@3d91cf52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:49:57,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-12-14 06:49:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:49:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 06:49:57,724 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:49:57,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:49:57,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:49:57,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:49:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1760724867, now seen corresponding path program 1 times [2022-12-14 06:49:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:49:57,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38184054] [2022-12-14 06:49:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:49:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:49:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:49:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:49:57,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:49:57,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38184054] [2022-12-14 06:49:57,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38184054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:49:57,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:49:57,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:49:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321599969] [2022-12-14 06:49:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:49:57,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:49:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:49:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:49:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:49:58,001 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:49:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:49:58,082 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-12-14 06:49:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:49:58,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-12-14 06:49:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:49:58,091 INFO L225 Difference]: With dead ends: 66 [2022-12-14 06:49:58,091 INFO L226 Difference]: Without dead ends: 60 [2022-12-14 06:49:58,093 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-12-14 06:49:58,097 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:49:58,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:49:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-14 06:49:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2022-12-14 06:49:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.625) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:49:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-12-14 06:49:58,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2022-12-14 06:49:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:49:58,133 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-12-14 06:49:58,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:49:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-12-14 06:49:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 06:49:58,134 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:49:58,134 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:49:58,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:49:58,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:49:58,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:49:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash 681145425, now seen corresponding path program 1 times [2022-12-14 06:49:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:49:58,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385640464] [2022-12-14 06:49:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:49:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:49:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:49:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:49:58,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:49:58,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385640464] [2022-12-14 06:49:58,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385640464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:49:58,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539936491] [2022-12-14 06:49:58,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:49:58,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:49:58,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:49:58,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:49:58,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 06:49:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:49:58,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:49:58,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:49:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:49:58,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:49:58,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539936491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:49:58,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:49:58,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 06:49:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652299342] [2022-12-14 06:49:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:49:58,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:49:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:49:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:49:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:49:58,393 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:49:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:49:58,481 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-12-14 06:49:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:49:58,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-14 06:49:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:49:58,482 INFO L225 Difference]: With dead ends: 60 [2022-12-14 06:49:58,482 INFO L226 Difference]: Without dead ends: 59 [2022-12-14 06:49:58,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:49:58,483 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 77 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:49:58,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 127 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:49:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-14 06:49:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2022-12-14 06:49:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:49:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-12-14 06:49:58,487 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2022-12-14 06:49:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:49:58,487 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-12-14 06:49:58,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:49:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-12-14 06:49:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 06:49:58,488 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:49:58,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:49:58,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 06:49:58,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:49:58,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:49:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:49:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash 699757211, now seen corresponding path program 1 times [2022-12-14 06:49:58,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:49:58,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975485414] [2022-12-14 06:49:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:49:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:49:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:49:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:49:58,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:49:58,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975485414] [2022-12-14 06:49:58,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975485414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:49:58,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:49:58,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:49:58,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821139121] [2022-12-14 06:49:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:49:58,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:49:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:49:58,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:49:58,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:49:58,732 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:49:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:49:58,766 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-12-14 06:49:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:49:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-14 06:49:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:49:58,767 INFO L225 Difference]: With dead ends: 41 [2022-12-14 06:49:58,767 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 06:49:58,767 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-12-14 06:49:58,768 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:49:58,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:49:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 06:49:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-12-14 06:49:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:49:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-12-14 06:49:58,775 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 11 [2022-12-14 06:49:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:49:58,775 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-12-14 06:49:58,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:49:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-12-14 06:49:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 06:49:58,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:49:58,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:49:58,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 06:49:58,776 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:49:58,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:49:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -359328235, now seen corresponding path program 1 times [2022-12-14 06:49:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:49:58,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748461918] [2022-12-14 06:49:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:49:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:49:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:49:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:49:58,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:49:58,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748461918] [2022-12-14 06:49:58,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748461918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:49:58,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839085024] [2022-12-14 06:49:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:49:58,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:49:58,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:49:58,840 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:49:58,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 06:49:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:49:58,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:49:58,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:49:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:49:58,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:49:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:49:58,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839085024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:49:58,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1706733722] [2022-12-14 06:49:58,975 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 06:49:58,975 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:49:58,978 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:49:58,983 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:49:58,984 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:49:59,110 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 8 treesize of output 7 [2022-12-14 06:49:59,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 06:49:59,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:49:59,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:49:59,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:49:59,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:49:59,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:49:59,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:49:59,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:49:59,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:49:59,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:49:59,431 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-12-14 06:49:59,460 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:50:00,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1706733722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:00,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:50:00,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5, 5] total 18 [2022-12-14 06:50:00,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178041745] [2022-12-14 06:50:00,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:00,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 06:50:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:00,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 06:50:00,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-12-14 06:50:00,084 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:50:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:00,562 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-12-14 06:50:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 06:50:00,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-14 06:50:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:00,564 INFO L225 Difference]: With dead ends: 52 [2022-12-14 06:50:00,564 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 06:50:00,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-12-14 06:50:00,565 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 75 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:00,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 147 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:50:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 06:50:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-12-14 06:50:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:50:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-12-14 06:50:00,581 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 12 [2022-12-14 06:50:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:00,582 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-12-14 06:50:00,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:50:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-12-14 06:50:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 06:50:00,582 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:00,583 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:00,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 06:50:00,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-14 06:50:00,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash -245286596, now seen corresponding path program 1 times [2022-12-14 06:50:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:00,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718521048] [2022-12-14 06:50:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:00,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:00,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718521048] [2022-12-14 06:50:00,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718521048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:00,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:50:00,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:50:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733566861] [2022-12-14 06:50:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:00,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:50:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:50:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:50:00,855 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:00,895 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-12-14 06:50:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:50:00,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2022-12-14 06:50:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:00,897 INFO L225 Difference]: With dead ends: 66 [2022-12-14 06:50:00,897 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 06:50:00,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:50:00,898 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 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-12-14 06:50:00,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 06:50:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2022-12-14 06:50:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5) internal successors, (48), 40 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 06:50:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-12-14 06:50:00,910 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 14 [2022-12-14 06:50:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:00,910 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-12-14 06:50:00,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-12-14 06:50:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 06:50:00,911 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:00,911 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:00,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 06:50:00,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash -245284497, now seen corresponding path program 1 times [2022-12-14 06:50:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638467343] [2022-12-14 06:50:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:00,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:00,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:00,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638467343] [2022-12-14 06:50:00,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638467343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:00,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:50:00,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:50:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066886315] [2022-12-14 06:50:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:00,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:50:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:50:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:50:00,967 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:01,017 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-12-14 06:50:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:50:01,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2022-12-14 06:50:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:01,018 INFO L225 Difference]: With dead ends: 64 [2022-12-14 06:50:01,018 INFO L226 Difference]: Without dead ends: 62 [2022-12-14 06:50:01,018 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-12-14 06:50:01,019 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:01,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 68 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-14 06:50:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-12-14 06:50:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 42 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 06:50:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-12-14 06:50:01,030 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2022-12-14 06:50:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:01,031 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-12-14 06:50:01,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-12-14 06:50:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 06:50:01,032 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:01,032 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:01,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 06:50:01,032 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1304044262, now seen corresponding path program 1 times [2022-12-14 06:50:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:01,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244217021] [2022-12-14 06:50:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:50:01,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:01,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244217021] [2022-12-14 06:50:01,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244217021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:01,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:50:01,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:50:01,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832257299] [2022-12-14 06:50:01,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:01,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:50:01,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:01,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:50:01,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:50:01,094 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:50:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:01,154 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-12-14 06:50:01,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:50:01,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-12-14 06:50:01,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:01,155 INFO L225 Difference]: With dead ends: 82 [2022-12-14 06:50:01,155 INFO L226 Difference]: Without dead ends: 73 [2022-12-14 06:50:01,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:50:01,156 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:01,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 135 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-14 06:50:01,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2022-12-14 06:50:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 57 states have internal predecessors, (73), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 06:50:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-12-14 06:50:01,177 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 14 [2022-12-14 06:50:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:01,177 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-12-14 06:50:01,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:50:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-12-14 06:50:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 06:50:01,178 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:01,178 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:01,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 06:50:01,178 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1593505982, now seen corresponding path program 1 times [2022-12-14 06:50:01,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:01,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832327978] [2022-12-14 06:50:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:01,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:01,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:01,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832327978] [2022-12-14 06:50:01,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832327978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:01,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:50:01,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:50:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817082765] [2022-12-14 06:50:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:01,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:50:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:50:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:50:01,229 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:01,282 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2022-12-14 06:50:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:50:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-12-14 06:50:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:01,283 INFO L225 Difference]: With dead ends: 111 [2022-12-14 06:50:01,284 INFO L226 Difference]: Without dead ends: 91 [2022-12-14 06:50:01,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-14 06:50:01,285 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:01,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-14 06:50:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2022-12-14 06:50:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 56 states have internal predecessors, (71), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 06:50:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-12-14 06:50:01,299 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 17 [2022-12-14 06:50:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:01,299 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-12-14 06:50:01,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-12-14 06:50:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 06:50:01,300 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:01,300 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:01,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 06:50:01,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:01,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash 978495982, now seen corresponding path program 1 times [2022-12-14 06:50:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:01,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392828855] [2022-12-14 06:50:01,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:01,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:01,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392828855] [2022-12-14 06:50:01,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392828855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:01,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880237522] [2022-12-14 06:50:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:01,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:01,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:01,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:01,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 06:50:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:01,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 06:50:01,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:01,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:50:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:01,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880237522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:50:01,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [902794220] [2022-12-14 06:50:01,460 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 06:50:01,460 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:50:01,460 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:50:01,461 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:50:01,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:50:01,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 06:50:01,512 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 8 treesize of output 7 [2022-12-14 06:50:01,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:01,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:01,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:01,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:01,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:01,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:01,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:01,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:01,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:01,827 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 06:50:01,846 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 51 for LOIs [2022-12-14 06:50:01,870 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:50:02,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [902794220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:02,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:50:02,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 18 [2022-12-14 06:50:02,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564222967] [2022-12-14 06:50:02,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:02,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 06:50:02,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:02,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 06:50:02,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-12-14 06:50:02,749 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:50:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:03,381 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-12-14 06:50:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:50:03,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-12-14 06:50:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:03,382 INFO L225 Difference]: With dead ends: 82 [2022-12-14 06:50:03,382 INFO L226 Difference]: Without dead ends: 73 [2022-12-14 06:50:03,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2022-12-14 06:50:03,383 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 61 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:03,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 132 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:50:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-14 06:50:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2022-12-14 06:50:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 56 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 06:50:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-12-14 06:50:03,398 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 17 [2022-12-14 06:50:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:03,398 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-12-14 06:50:03,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:50:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-12-14 06:50:03,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 06:50:03,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:03,399 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:03,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 06:50:03,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-14 06:50:03,600 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash 904044068, now seen corresponding path program 1 times [2022-12-14 06:50:03,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:03,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921850213] [2022-12-14 06:50:03,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:03,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 06:50:03,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:03,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921850213] [2022-12-14 06:50:03,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921850213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:03,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133831583] [2022-12-14 06:50:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:03,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:03,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:03,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:03,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 06:50:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:03,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 06:50:03,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 06:50:03,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:50:03,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133831583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:03,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:50:03,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-14 06:50:03,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748453771] [2022-12-14 06:50:03,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:03,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:50:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:03,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:50:03,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:50:03,772 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:03,810 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-12-14 06:50:03,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:50:03,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-12-14 06:50:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:03,811 INFO L225 Difference]: With dead ends: 76 [2022-12-14 06:50:03,811 INFO L226 Difference]: Without dead ends: 49 [2022-12-14 06:50:03,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:50:03,812 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:03,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-14 06:50:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-12-14 06:50:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:50:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-12-14 06:50:03,823 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 22 [2022-12-14 06:50:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:03,823 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-12-14 06:50:03,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-12-14 06:50:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 06:50:03,824 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:03,824 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:03,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 06:50:04,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:04,025 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:04,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1125078776, now seen corresponding path program 1 times [2022-12-14 06:50:04,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:04,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345525720] [2022-12-14 06:50:04,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:04,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 06:50:04,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:04,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345525720] [2022-12-14 06:50:04,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345525720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:04,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630792063] [2022-12-14 06:50:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:04,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:04,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:04,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:04,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 06:50:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:04,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 06:50:04,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 06:50:04,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:50:04,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630792063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:04,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:50:04,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 06:50:04,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167989524] [2022-12-14 06:50:04,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:04,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:50:04,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:04,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:50:04,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:50:04,183 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-12-14 06:50:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:04,235 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-12-14 06:50:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:50:04,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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) Word has length 25 [2022-12-14 06:50:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:04,236 INFO L225 Difference]: With dead ends: 56 [2022-12-14 06:50:04,236 INFO L226 Difference]: Without dead ends: 54 [2022-12-14 06:50:04,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-14 06:50:04,237 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:04,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 71 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-14 06:50:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-12-14 06:50:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:50:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-12-14 06:50:04,246 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 25 [2022-12-14 06:50:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:04,246 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-12-14 06:50:04,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-12-14 06:50:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-12-14 06:50:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 06:50:04,247 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:04,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:04,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 06:50:04,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:04,448 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash -782412162, now seen corresponding path program 1 times [2022-12-14 06:50:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:04,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340793902] [2022-12-14 06:50:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:50:04,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:04,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340793902] [2022-12-14 06:50:04,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340793902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:04,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761006221] [2022-12-14 06:50:04,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:04,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:04,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:04,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:04,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 06:50:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:04,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 06:50:04,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:04,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:50:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:04,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761006221] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:50:04,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1912544595] [2022-12-14 06:50:04,708 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 06:50:04,708 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:50:04,709 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:50:04,709 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:50:04,709 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:50:04,745 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 8 treesize of output 7 [2022-12-14 06:50:04,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 06:50:04,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:04,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:04,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:04,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:04,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:04,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:04,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:04,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:04,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:04,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:04,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:04,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:05,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 06:50:05,110 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-14 06:50:05,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 06:50:05,304 INFO L321 Elim1Store]: treesize reduction 197, result has 19.3 percent of original size [2022-12-14 06:50:05,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 209 treesize of output 229 [2022-12-14 06:50:05,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 06:50:05,516 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-12-14 06:50:05,584 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:50:08,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1912544595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:08,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:50:08,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5, 9, 9] total 32 [2022-12-14 06:50:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155156792] [2022-12-14 06:50:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:08,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 06:50:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:08,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 06:50:08,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2022-12-14 06:50:08,180 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:09,520 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-12-14 06:50:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 06:50:09,520 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-12-14 06:50:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:09,520 INFO L225 Difference]: With dead ends: 54 [2022-12-14 06:50:09,520 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 06:50:09,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 06:50:09,521 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:09,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 101 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:50:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 06:50:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-12-14 06:50:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 46 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:50:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-12-14 06:50:09,530 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 25 [2022-12-14 06:50:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:09,530 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-12-14 06:50:09,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-12-14 06:50:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 06:50:09,531 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:09,531 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:09,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 06:50:09,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 06:50:09,732 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash 517703792, now seen corresponding path program 1 times [2022-12-14 06:50:09,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:09,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051350953] [2022-12-14 06:50:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 06:50:09,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:09,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051350953] [2022-12-14 06:50:09,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051350953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:09,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574885418] [2022-12-14 06:50:09,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:09,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:09,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:09,808 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:09,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 06:50:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:09,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 06:50:09,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 06:50:09,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:50:09,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574885418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:09,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:50:09,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 06:50:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700263815] [2022-12-14 06:50:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:09,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:50:09,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:09,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:50:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:50:09,886 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 06:50:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:09,911 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-12-14 06:50:09,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:50:09,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-12-14 06:50:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:09,912 INFO L225 Difference]: With dead ends: 52 [2022-12-14 06:50:09,912 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 06:50:09,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:50:09,912 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:09,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 06:50:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-12-14 06:50:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:50:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-12-14 06:50:09,926 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2022-12-14 06:50:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:09,926 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-12-14 06:50:09,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 06:50:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-12-14 06:50:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 06:50:09,926 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:09,927 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:09,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 06:50:10,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:10,128 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash 517768852, now seen corresponding path program 1 times [2022-12-14 06:50:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:10,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236180013] [2022-12-14 06:50:10,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:10,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 06:50:10,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:10,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236180013] [2022-12-14 06:50:10,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236180013] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:10,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981779093] [2022-12-14 06:50:10,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:10,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:10,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:10,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:10,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 06:50:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:10,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 06:50:10,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:10,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:50:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 06:50:10,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981779093] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:50:10,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [39411042] [2022-12-14 06:50:10,408 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 06:50:10,408 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:50:10,408 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:50:10,408 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:50:10,408 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:50:10,433 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 8 treesize of output 7 [2022-12-14 06:50:10,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 06:50:10,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:10,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:10,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:10,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:10,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:10,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:10,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:10,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:10,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:10,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:10,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:10,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:10,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:10,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:10,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:11,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:11,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:11,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:11,150 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-12-14 06:50:11,225 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:50:12,942 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2929#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (< 2147483646 |ULTIMATE.start_alloc_17_#t~post38#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_17_~array#1.base|) (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) |ULTIMATE.start_alloc_17_~array#1.offset|))) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_17_~array#1.base|) (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) |ULTIMATE.start_alloc_17_~array#1.offset|)) |ULTIMATE.start_alloc_17_~p~0#1.offset|) (not (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (= |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_#t~post38#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 06:50:12,942 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 06:50:12,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:50:12,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-12-14 06:50:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877548472] [2022-12-14 06:50:12,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:50:12,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 06:50:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:12,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 06:50:12,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-12-14 06:50:12,944 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-12-14 06:50:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:13,158 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2022-12-14 06:50:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:50:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 26 [2022-12-14 06:50:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:13,159 INFO L225 Difference]: With dead ends: 149 [2022-12-14 06:50:13,159 INFO L226 Difference]: Without dead ends: 124 [2022-12-14 06:50:13,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 06:50:13,160 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 123 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:13,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 264 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:50:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-14 06:50:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 67. [2022-12-14 06:50:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 59 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 06:50:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-12-14 06:50:13,171 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 26 [2022-12-14 06:50:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:13,172 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-12-14 06:50:13,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-12-14 06:50:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-12-14 06:50:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 06:50:13,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:13,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:13,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 06:50:13,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 06:50:13,374 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash 66321110, now seen corresponding path program 1 times [2022-12-14 06:50:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:13,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365538193] [2022-12-14 06:50:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 06:50:13,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:13,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365538193] [2022-12-14 06:50:13,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365538193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:13,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814630923] [2022-12-14 06:50:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:13,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:13,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:13,473 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:13,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 06:50:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:13,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 06:50:13,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:50:13,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:50:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:50:13,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814630923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:50:13,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [851206849] [2022-12-14 06:50:13,643 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 06:50:13,643 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:50:13,644 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:50:13,644 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:50:13,644 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:50:13,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 06:50:13,675 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 8 treesize of output 7 [2022-12-14 06:50:13,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:13,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:13,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:13,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:13,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:13,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:13,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:13,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:13,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:13,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:13,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:13,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:13,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:13,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:13,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:14,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 06:50:14,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 06:50:14,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 06:50:14,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 06:50:14,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:14,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:14,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:14,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:14,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:14,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-12-14 06:50:14,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-12-14 06:50:14,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:14,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:14,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 06:50:14,845 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-14 06:50:14,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 06:50:14,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 06:50:14,959 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-12-14 06:50:15,009 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:50:17,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [851206849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:17,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:50:17,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5, 9, 9] total 31 [2022-12-14 06:50:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400050389] [2022-12-14 06:50:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:17,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 06:50:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:17,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 06:50:17,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-12-14 06:50:17,168 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:19,326 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-12-14 06:50:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 06:50:19,326 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-12-14 06:50:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:19,327 INFO L225 Difference]: With dead ends: 76 [2022-12-14 06:50:19,327 INFO L226 Difference]: Without dead ends: 75 [2022-12-14 06:50:19,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 06:50:19,328 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:19,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:50:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-14 06:50:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2022-12-14 06:50:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 59 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 06:50:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-12-14 06:50:19,341 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 25 [2022-12-14 06:50:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:19,341 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-12-14 06:50:19,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-12-14 06:50:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 06:50:19,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:19,341 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:19,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 06:50:19,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 06:50:19,543 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1515026892, now seen corresponding path program 1 times [2022-12-14 06:50:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:19,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165271411] [2022-12-14 06:50:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:50:19,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:19,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165271411] [2022-12-14 06:50:19,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165271411] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:19,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355801300] [2022-12-14 06:50:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:19,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:19,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:19,626 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:19,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 06:50:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:19,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 06:50:19,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:19,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:50:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:19,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355801300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:50:19,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1313815515] [2022-12-14 06:50:19,825 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 06:50:19,826 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:50:19,826 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:50:19,826 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:50:19,826 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:50:19,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 06:50:19,855 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 8 treesize of output 7 [2022-12-14 06:50:19,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:19,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:19,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:19,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:19,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:19,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:20,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:20,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:20,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:20,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:20,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:20,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:20,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 06:50:20,174 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-14 06:50:20,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 06:50:20,359 INFO L321 Elim1Store]: treesize reduction 120, result has 16.7 percent of original size [2022-12-14 06:50:20,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 206 [2022-12-14 06:50:20,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 06:50:20,481 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-12-14 06:50:20,571 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:50:22,955 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3810#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (< 2147483646 |ULTIMATE.start_free_17_#t~post42#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (<= |ULTIMATE.start_free_17_~array#1.offset| 0) (<= 0 |ULTIMATE.start_free_17_~len#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_free_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~len#1|) (<= 0 |ULTIMATE.start_free_17_~i~1#1|) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (<= (+ |ULTIMATE.start_alloc_17_~j~0#1| 1) 0) (= |~#ldv_global_msg_list~0.base| 1) (= 3 |ULTIMATE.start_alloc_17_#res#1|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_free_17_~array#1.offset|) (<= |ULTIMATE.start_free_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~array#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_free_17_#in~array#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-12-14 06:50:22,955 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 06:50:22,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:50:22,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2022-12-14 06:50:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068853931] [2022-12-14 06:50:22,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:50:22,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 06:50:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:22,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 06:50:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 06:50:22,957 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 06:50:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:23,136 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2022-12-14 06:50:23,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:50:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-12-14 06:50:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:23,138 INFO L225 Difference]: With dead ends: 88 [2022-12-14 06:50:23,138 INFO L226 Difference]: Without dead ends: 69 [2022-12-14 06:50:23,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 06:50:23,139 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:23,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 225 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:50:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-14 06:50:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2022-12-14 06:50:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 06:50:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-12-14 06:50:23,157 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 26 [2022-12-14 06:50:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:23,157 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-12-14 06:50:23,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 06:50:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-12-14 06:50:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 06:50:23,157 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:23,157 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:23,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 06:50:23,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 06:50:23,359 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1685648934, now seen corresponding path program 1 times [2022-12-14 06:50:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:23,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333530571] [2022-12-14 06:50:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 06:50:23,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:23,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333530571] [2022-12-14 06:50:23,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333530571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:23,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:50:23,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:50:23,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727190708] [2022-12-14 06:50:23,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:23,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:50:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:23,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:50:23,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:50:23,426 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:50:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:23,464 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-12-14 06:50:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:50:23,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-12-14 06:50:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:23,465 INFO L225 Difference]: With dead ends: 66 [2022-12-14 06:50:23,465 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 06:50:23,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:50:23,466 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:23,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 06:50:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-12-14 06:50:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 58 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 06:50:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-12-14 06:50:23,482 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 31 [2022-12-14 06:50:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:23,482 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-12-14 06:50:23,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:50:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-12-14 06:50:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 06:50:23,482 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:23,483 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:23,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 06:50:23,483 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash -715509284, now seen corresponding path program 1 times [2022-12-14 06:50:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:23,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096606495] [2022-12-14 06:50:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 06:50:23,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:23,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096606495] [2022-12-14 06:50:23,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096606495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:23,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502907629] [2022-12-14 06:50:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:23,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:23,544 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:23,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 06:50:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:23,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 06:50:23,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 06:50:23,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:50:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 06:50:23,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502907629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:50:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1393732018] [2022-12-14 06:50:23,688 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 06:50:23,688 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:50:23,689 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:50:23,689 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:50:23,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:50:23,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 06:50:23,719 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 8 treesize of output 7 [2022-12-14 06:50:23,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:23,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:23,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:23,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:23,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:23,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:23,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:23,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:23,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:23,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:23,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:23,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:24,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:24,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:24,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:24,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:24,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:24,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-12-14 06:50:24,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:50:24,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:24,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:24,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:24,456 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-12-14 06:50:24,494 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:50:26,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1393732018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:26,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:50:26,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [6, 6, 6] total 28 [2022-12-14 06:50:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925158164] [2022-12-14 06:50:26,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:26,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 06:50:26,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:26,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 06:50:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2022-12-14 06:50:26,218 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:27,703 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2022-12-14 06:50:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 06:50:27,703 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-12-14 06:50:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:27,704 INFO L225 Difference]: With dead ends: 92 [2022-12-14 06:50:27,704 INFO L226 Difference]: Without dead ends: 90 [2022-12-14 06:50:27,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 06:50:27,705 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 110 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:27,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 59 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:50:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-14 06:50:27,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2022-12-14 06:50:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 53 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:50:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-12-14 06:50:27,721 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 32 [2022-12-14 06:50:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:27,722 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-12-14 06:50:27,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-12-14 06:50:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 06:50:27,722 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:27,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:27,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 06:50:27,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 06:50:27,923 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2046791233, now seen corresponding path program 2 times [2022-12-14 06:50:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:27,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897940314] [2022-12-14 06:50:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:50:28,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:28,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897940314] [2022-12-14 06:50:28,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897940314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:28,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780906263] [2022-12-14 06:50:28,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:50:28,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:28,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:28,122 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:28,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 06:50:28,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 06:50:28,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:50:28,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 06:50:28,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 06:50:28,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:50:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 06:50:28,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780906263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:50:28,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [66992571] [2022-12-14 06:50:28,288 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 06:50:28,288 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:50:28,288 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:50:28,288 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:50:28,288 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:50:28,320 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 8 treesize of output 7 [2022-12-14 06:50:28,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 06:50:28,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:28,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:28,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:28,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:28,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:28,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:28,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:28,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:28,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:28,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 06:50:28,655 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-14 06:50:28,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-12-14 06:50:28,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 06:50:28,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 06:50:28,873 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 69 for LOIs [2022-12-14 06:50:28,933 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:50:31,762 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4890#(and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (< 2147483646 |ULTIMATE.start_free_17_#t~post42#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) (<= |ULTIMATE.start_free_17_~array#1.offset| 0) (<= 0 |ULTIMATE.start_free_17_~len#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216) (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0) (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_free_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~len#1|) (<= 0 |ULTIMATE.start_free_17_~i~1#1|) (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) (<= |~#ldv_global_msg_list~0.base| 1) (<= 0 |ULTIMATE.start_alloc_17_~len#1|) (<= (+ |ULTIMATE.start_alloc_17_~j~0#1| 1) 0) (= 3 |ULTIMATE.start_alloc_17_#res#1|) (= |#NULL.offset| 0) (<= 1 |~#ldv_global_msg_list~0.base|) (<= 0 |ULTIMATE.start_free_17_~array#1.offset|) (<= |ULTIMATE.start_free_17_~len#1| 16777216) (<= 0 |ULTIMATE.start_free_17_#in~array#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_free_17_#in~array#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-12-14 06:50:31,762 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 06:50:31,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:50:31,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 19 [2022-12-14 06:50:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101732885] [2022-12-14 06:50:31,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:50:31,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 06:50:31,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:31,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 06:50:31,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 06:50:31,764 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 06:50:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:32,045 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2022-12-14 06:50:32,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 06:50:32,046 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2022-12-14 06:50:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:32,046 INFO L225 Difference]: With dead ends: 110 [2022-12-14 06:50:32,046 INFO L226 Difference]: Without dead ends: 76 [2022-12-14 06:50:32,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=285, Invalid=2067, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 06:50:32,047 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 119 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:32,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 216 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:50:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-14 06:50:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-12-14 06:50:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 60 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 06:50:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2022-12-14 06:50:32,061 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 32 [2022-12-14 06:50:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:32,061 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2022-12-14 06:50:32,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 06:50:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-12-14 06:50:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 06:50:32,061 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:32,061 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:32,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 06:50:32,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:32,262 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:32,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash 185765956, now seen corresponding path program 1 times [2022-12-14 06:50:32,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:32,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598542400] [2022-12-14 06:50:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:32,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 06:50:32,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:32,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598542400] [2022-12-14 06:50:32,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598542400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:32,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384068750] [2022-12-14 06:50:32,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:32,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:32,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:32,376 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:32,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 06:50:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:32,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 06:50:32,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 06:50:32,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:50:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 06:50:32,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384068750] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:50:32,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1673414660] [2022-12-14 06:50:32,515 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 06:50:32,515 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:50:32,515 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:50:32,515 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:50:32,515 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:50:32,546 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 8 treesize of output 7 [2022-12-14 06:50:32,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 06:50:32,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:32,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:32,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:32,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:32,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:32,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:33,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:33,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:33,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-12-14 06:50:33,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:50:33,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:33,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:50:33,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 06:50:33,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:50:33,209 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 42 treesize of output 33 [2022-12-14 06:50:33,224 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:50:33,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 06:50:33,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:33,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:33,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-12-14 06:50:33,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:50:33,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:33,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-12-14 06:50:33,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:50:33,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:33,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-12-14 06:50:33,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:33,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 06:50:33,458 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 65 for LOIs [2022-12-14 06:50:33,502 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:50:35,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1673414660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:35,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:50:35,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 8, 8] total 25 [2022-12-14 06:50:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610150041] [2022-12-14 06:50:35,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:35,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 06:50:35,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:35,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 06:50:35,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-12-14 06:50:35,004 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:36,071 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-12-14 06:50:36,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 06:50:36,072 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-12-14 06:50:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:36,072 INFO L225 Difference]: With dead ends: 68 [2022-12-14 06:50:36,072 INFO L226 Difference]: Without dead ends: 67 [2022-12-14 06:50:36,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 06:50:36,073 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:36,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 30 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:50:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-14 06:50:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2022-12-14 06:50:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 06:50:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2022-12-14 06:50:36,089 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 35 [2022-12-14 06:50:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:36,089 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2022-12-14 06:50:36,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:50:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-12-14 06:50:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 06:50:36,089 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:36,089 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:36,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 06:50:36,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:36,290 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2013297170, now seen corresponding path program 1 times [2022-12-14 06:50:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:36,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859473174] [2022-12-14 06:50:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 06:50:36,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:36,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859473174] [2022-12-14 06:50:36,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859473174] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:36,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752876379] [2022-12-14 06:50:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:36,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:36,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:36,372 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:36,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 06:50:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:36,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:50:36,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 06:50:36,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:50:36,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752876379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:36,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:50:36,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-12-14 06:50:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478173508] [2022-12-14 06:50:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:36,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:50:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:50:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:50:36,487 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-12-14 06:50:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:36,550 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-12-14 06:50:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:50:36,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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) Word has length 36 [2022-12-14 06:50:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:36,551 INFO L225 Difference]: With dead ends: 80 [2022-12-14 06:50:36,551 INFO L226 Difference]: Without dead ends: 67 [2022-12-14 06:50:36,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-14 06:50:36,552 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:36,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 64 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-14 06:50:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-12-14 06:50:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 06:50:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-12-14 06:50:36,566 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 36 [2022-12-14 06:50:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:36,567 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-12-14 06:50:36,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-12-14 06:50:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-12-14 06:50:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 06:50:36,567 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:50:36,567 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:50:36,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 06:50:36,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:36,768 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-12-14 06:50:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:50:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1142121594, now seen corresponding path program 1 times [2022-12-14 06:50:36,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:50:36,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602840315] [2022-12-14 06:50:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:36,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:50:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 06:50:36,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:50:36,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602840315] [2022-12-14 06:50:36,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602840315] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:50:36,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556494189] [2022-12-14 06:50:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:50:36,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:50:36,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:50:36,833 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:50:36,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 06:50:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:50:36,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:50:36,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:50:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 06:50:36,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:50:36,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556494189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:50:36,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:50:36,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 06:50:36,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194583702] [2022-12-14 06:50:36,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:50:36,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:50:36,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:50:36,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:50:36,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:50:36,925 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:50:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:50:36,970 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-12-14 06:50:36,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:50:36,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-12-14 06:50:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:50:36,971 INFO L225 Difference]: With dead ends: 64 [2022-12-14 06:50:36,971 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 06:50:36,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:50:36,972 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:50:36,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:50:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 06:50:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 06:50:36,972 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-12-14 06:50:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 06:50:36,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-12-14 06:50:36,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:50:36,973 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 06:50:36,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:50:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 06:50:36,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 06:50:36,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-12-14 06:50:36,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-12-14 06:50:36,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-12-14 06:50:36,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-12-14 06:50:36,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-12-14 06:50:36,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-12-14 06:50:36,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-12-14 06:50:36,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-12-14 06:50:36,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-12-14 06:50:36,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-12-14 06:50:36,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 06:50:37,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 06:50:37,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 06:51:55,853 WARN L233 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 270 DAG size of output: 268 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-14 06:52:40,275 WARN L233 SmtUtils]: Spent 43.65s on a formula simplification. DAG size of input: 182 DAG size of output: 181 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-14 06:52:45,630 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 525 531) the Hoare annotation is: (or (not (<= 0 |#NULL.offset|)) (not (<= |~#ldv_global_msg_list~0.base| 1)) (not (<= 0 |~#ldv_global_msg_list~0.offset|)) (not (<= 1 |~#ldv_global_msg_list~0.base|)) (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= 0 |#StackHeapBarrier|)) (and (not (= |ldv_malloc_#in~size| 4)) (let ((.cse0 (div (- |ldv_malloc_#in~size|) (- 4))) (.cse2 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|)) (.cse3 (+ |~#ldv_global_msg_list~0.offset| 4))) (or (not (= (select |old(#valid)| 1) 1)) (not (= (mod (* |ldv_malloc_#in~size| 3) 4) 0)) (not (< 0 |#StackHeapBarrier|)) (not (< 0 .cse0)) (not (= (select |old(#length)| 1) 8)) (not (= (select .cse1 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|)) (not (< .cse0 16777216)) (not (= |~#ldv_global_msg_list~0.base| (select .cse2 .cse3))) (not (= (select |old(#valid)| 0) 0)) (not (= |~#ldv_global_msg_list~0.base| (select .cse2 |~#ldv_global_msg_list~0.offset|))) (not (= |~#ldv_global_msg_list~0.offset| (select .cse1 .cse3)))))) (not (<= |~#ldv_global_msg_list~0.offset| 0)) (not (<= |#NULL.base| 0))) [2022-12-14 06:52:45,631 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-12-14 06:52:45,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-12-14 06:52:45,631 INFO L895 garLoopResultBuilder]: At program point L787-2(line 787) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse2 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (= |~#ldv_global_msg_list~0.base| (select .cse0 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648)) (= |~#ldv_global_msg_list~0.base| (select .cse0 .cse1)) (= |~#ldv_global_msg_list~0.offset| 0) (= |~#ldv_global_msg_list~0.offset| (select .cse2 .cse1)) (= (select |#valid| 1) 1) (< |ULTIMATE.start_entry_point_~len~0#1| 16777216) (let ((.cse3 (< 0 |ULTIMATE.start_ldv_positive_~r~1#1|))) (or (and (= |ULTIMATE.start_ldv_positive_~r~1#1| |ULTIMATE.start_ldv_positive_#res#1|) .cse3) (and (not .cse3) (= |ULTIMATE.start_ldv_positive_#res#1| 1)))) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_ldv_positive_#res#1| |ULTIMATE.start_entry_point_~len~0#1|) (= |#NULL.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse2 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-12-14 06:52:45,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-12-14 06:52:45,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-12-14 06:52:45,631 INFO L899 garLoopResultBuilder]: For program point L788(line 788) no Hoare annotation was computed. [2022-12-14 06:52:45,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-12-14 06:52:45,631 INFO L899 garLoopResultBuilder]: For program point L780-3(line 780) no Hoare annotation was computed. [2022-12-14 06:52:45,631 INFO L899 garLoopResultBuilder]: For program point L780-4(line 780) no Hoare annotation was computed. [2022-12-14 06:52:45,632 INFO L895 garLoopResultBuilder]: At program point L780-5(lines 780 782) the Hoare annotation is: (let ((.cse51 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1))) (let ((.cse7 (= |ULTIMATE.start_free_17_~array#1.base| |ULTIMATE.start_free_17_#in~array#1.base|)) (.cse12 (= |ULTIMATE.start_free_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse13 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse17 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse18 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_free_17_#in~array#1.base|)) (.cse21 (= |ULTIMATE.start_free_17_#in~len#1| |ULTIMATE.start_free_17_~len#1|)) (.cse24 (= |ULTIMATE.start_free_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse28 (= |ULTIMATE.start_free_17_#in~array#1.offset| |ULTIMATE.start_free_17_~array#1.offset|)) (.cse10 (= |ULTIMATE.start_alloc_17_#res#1| 0)) (.cse9 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse16 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse20 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse22 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse27 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse26 (= |ULTIMATE.start_free_17_~i~1#1| 0)) (.cse45 (<= 1 |ULTIMATE.start_free_17_~i~1#1|)) (.cse31 (<= 0 .cse51)) (.cse39 (<= |ULTIMATE.start_alloc_17_~j~0#1| 2147483647)) (.cse42 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse43 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse30 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse4 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse32 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse33 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse34 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse6 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse58 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse35 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216)) (.cse36 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse59 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) (.cse8 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse37 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse38 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|)) (.cse11 (<= |#NULL.offset| 0)) (.cse40 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse14 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse41 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216)) (.cse15 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse44 (<= |ULTIMATE.start_free_17_~len#1| 16777215)) (.cse19 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse23 (<= 0 |#NULL.offset|)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse29 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~len#1| |ULTIMATE.start_alloc_17_~i~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse0 .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse31 .cse32 .cse33 .cse34 .cse6 .cse35 .cse36 .cse8 .cse37 .cse38 .cse39 .cse11 .cse40 .cse14 .cse41 .cse15 .cse42 .cse43 .cse44 .cse19 .cse23 .cse25 .cse26 .cse29) (and (let ((.cse46 (<= |ULTIMATE.start_free_17_~array#1.offset| 0)) (.cse47 (<= 0 |ULTIMATE.start_free_17_~len#1|)) (.cse48 (<= |ULTIMATE.start_free_17_#in~len#1| 16777216)) (.cse49 (<= 0 |ULTIMATE.start_free_17_#in~len#1|)) (.cse50 (<= |ULTIMATE.start_free_17_~i~1#1| 2147483647)) (.cse55 (<= 0 |ULTIMATE.start_free_17_~array#1.offset|)) (.cse56 (<= 0 |ULTIMATE.start_free_17_#in~array#1.offset|)) (.cse57 (<= |ULTIMATE.start_free_17_#in~array#1.offset| 0))) (or (and .cse9 (let ((.cse52 (= |~#ldv_global_msg_list~0.base| 1)) (.cse53 (= 3 |ULTIMATE.start_alloc_17_#res#1|)) (.cse54 (= |#NULL.offset| 0))) (or (and .cse45 .cse1 .cse30 .cse2 .cse4 .cse46 .cse47 .cse5 .cse31 .cse32 .cse33 .cse34 .cse6 .cse36 .cse37 .cse48 .cse49 .cse50 .cse14 (<= .cse51 0) .cse52 .cse53 .cse54 .cse55 .cse56 .cse57) (and .cse1 .cse2 .cse4 .cse32 .cse33 .cse6 .cse7 .cse36 .cse37 (= .cse51 |ULTIMATE.start_alloc_17_~i~0#1|) .cse12 .cse13 .cse14 .cse17 .cse18 .cse52 .cse53 .cse54 .cse21 .cse24 .cse26 .cse28))) .cse40 .cse16 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) .cse20 .cse22 .cse25 .cse27 .cse29) (and (not .cse40) .cse0 .cse1 .cse30 .cse2 .cse3 .cse4 .cse46 .cse47 .cse5 .cse32 .cse33 .cse34 .cse6 .cse58 .cse35 .cse36 .cse59 .cse8 .cse38 .cse48 .cse10 .cse11 .cse49 .cse50 (<= 0 |ULTIMATE.start_free_17_~i~1#1|) .cse14 .cse41 (or (let ((.cse60 (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) (- 4) |ULTIMATE.start_alloc_17_~array#1.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_17_~array#1.base|) .cse60) |ULTIMATE.start_alloc_17_~p~0#1.offset|) (not .cse37) .cse42 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_17_~array#1.base|) .cse60) |ULTIMATE.start_alloc_17_~p~0#1.base|))) (and .cse9 .cse16 .cse20 .cse22 .cse27)) .cse15 (<= 0 |ULTIMATE.start_alloc_17_~len#1|) .cse19 .cse55 .cse23 .cse56 .cse25 .cse57 .cse29))) .cse43 .cse44) (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) .cse8 (<= |ULTIMATE.start_free_17_~len#1| 0) .cse11 .cse14 .cse15 .cse19 .cse23 .cse25 .cse26 .cse29) (and .cse0 .cse45 .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse31 .cse32 .cse33 .cse34 .cse6 .cse58 .cse35 .cse36 .cse59 .cse8 .cse37 .cse38 .cse39 .cse11 .cse40 .cse14 .cse41 .cse15 .cse42 .cse43 .cse44 .cse19 .cse23 .cse25 .cse29) (and .cse0 (<= |ULTIMATE.start_entry_point_~len~0#1| 2) .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse32 .cse33 .cse34 .cse6 .cse58 .cse35 .cse36 .cse59 .cse8 .cse37 .cse38 .cse11 (<= |ULTIMATE.start_entry_point_~i~2#1| 2) .cse40 .cse14 .cse41 .cse15 (<= |ULTIMATE.start_free_17_~len#1| |ULTIMATE.start_free_17_~i~1#1|) .cse44 .cse19 .cse23 .cse25 .cse29)))) [2022-12-14 06:52:45,632 INFO L899 garLoopResultBuilder]: For program point L772(line 772) no Hoare annotation was computed. [2022-12-14 06:52:45,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 790) no Hoare annotation was computed. [2022-12-14 06:52:45,632 INFO L899 garLoopResultBuilder]: For program point L772-4(line 772) no Hoare annotation was computed. [2022-12-14 06:52:45,632 INFO L899 garLoopResultBuilder]: For program point L772-5(line 772) no Hoare annotation was computed. [2022-12-14 06:52:45,632 INFO L895 garLoopResultBuilder]: At program point L772-6(lines 772 775) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse0 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse1 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse4 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse5 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse12 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (.cse17 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse6 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse7 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse18 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse9 (<= |#NULL.offset| 0)) (.cse19 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse10 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse11 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse20 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse13 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse14 (<= 0 |#NULL.offset|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse12 0) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 (= .cse12 |ULTIMATE.start_alloc_17_~i~0#1|) .cse9 .cse19 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse10 .cse11 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse20 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) .cse13 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse14 .cse15 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) .cse16) (and .cse0 .cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse2 .cse3 .cse4 .cse5 (<= 0 .cse12) .cse17 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0) (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse6 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) .cse7 .cse18 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) (<= |ULTIMATE.start_alloc_17_~j~0#1| 2147483647) .cse9 .cse19 .cse10 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse11 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse20 .cse13 .cse14 .cse15 .cse16))) [2022-12-14 06:52:45,632 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 796) no Hoare annotation was computed. [2022-12-14 06:52:45,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 780) no Hoare annotation was computed. [2022-12-14 06:52:45,633 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2022-12-14 06:52:45,633 INFO L899 garLoopResultBuilder]: For program point L765-3(line 765) no Hoare annotation was computed. [2022-12-14 06:52:45,633 INFO L899 garLoopResultBuilder]: For program point L765-4(line 765) no Hoare annotation was computed. [2022-12-14 06:52:45,633 INFO L895 garLoopResultBuilder]: At program point L765-5(lines 765 769) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_alloc_17_~i~0#1| 0))) (let ((.cse0 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse1 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse2 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse3 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse4 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse6 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse7 (<= 0 |ULTIMATE.start_alloc_17_~len#1|)) (.cse8 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse9 (= |~#ldv_global_msg_list~0.base| 1)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (or (and .cse14 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) (not (< |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|))) (let ((.cse15 (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) (- 4) |ULTIMATE.start_alloc_17_~array#1.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_17_~array#1.base|) .cse15) |ULTIMATE.start_alloc_17_~p~0#1.offset|) (not (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_17_~array#1.base|) .cse15) |ULTIMATE.start_alloc_17_~p~0#1.base|))))) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (= |#NULL.base| 0))) (or (and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) .cse0 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse1 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) .cse2 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse3 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse4 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) .cse5 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse6 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse6 .cse7 .cse8 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) .cse9 .cse10 .cse11 .cse12 .cse13)))) [2022-12-14 06:52:45,633 INFO L899 garLoopResultBuilder]: For program point L790-3(line 790) no Hoare annotation was computed. [2022-12-14 06:52:45,633 INFO L899 garLoopResultBuilder]: For program point L790-4(line 790) no Hoare annotation was computed. [2022-12-14 06:52:45,633 INFO L895 garLoopResultBuilder]: At program point L790-5(lines 790 792) the Hoare annotation is: (let ((.cse0 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse1 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse2 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse3 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse4 (= |~#ldv_global_msg_list~0.base| 1)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (= |#NULL.base| 0))) (or (and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) (<= 1 |ULTIMATE.start_entry_point_~i~2#1|) (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216) .cse0 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|) .cse1 .cse2 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216) .cse3 .cse4 .cse5 (<= 0 |#StackHeapBarrier|) .cse6) (let ((.cse7 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse8 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse9 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) (= |~#ldv_global_msg_list~0.base| (select .cse7 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) .cse0 (= |~#ldv_global_msg_list~0.base| (select .cse7 .cse8)) .cse1 .cse2 (= |~#ldv_global_msg_list~0.offset| (select .cse9 .cse8)) (= (select |#valid| 1) 1) .cse3 (let ((.cse10 (< 0 |ULTIMATE.start_ldv_positive_~r~1#1|))) (or (and (= |ULTIMATE.start_ldv_positive_~r~1#1| |ULTIMATE.start_ldv_positive_#res#1|) .cse10) (and (not .cse10) (= |ULTIMATE.start_ldv_positive_#res#1| 1)))) .cse4 (= (select |#valid| 0) 0) (= |ULTIMATE.start_ldv_positive_#res#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse5 (< 0 |#StackHeapBarrier|) .cse6 (= (select .cse9 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))))) [2022-12-14 06:52:45,633 INFO L895 garLoopResultBuilder]: At program point L766(line 766) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse1 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.cse2 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse3 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse4 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse6 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse7 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse8 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse9 (= |~#ldv_global_msg_list~0.base| 1)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (or (and (= |ULTIMATE.start_alloc_17_~i~0#1| 0) (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) (not (< |ULTIMATE.start_entry_point_~i~2#1| |ULTIMATE.start_entry_point_~len~0#1|))) (let ((.cse14 (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) (- 4) |ULTIMATE.start_alloc_17_~array#1.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_17_~array#1.base|) .cse14) |ULTIMATE.start_alloc_17_~p~0#1.offset|) (not (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_17_~array#1.base|) .cse14) |ULTIMATE.start_alloc_17_~p~0#1.base|))))) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (= |#NULL.base| 0))) (or (and (<= 0 |ULTIMATE.start_entry_point_~len~0#1|) .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|) .cse3 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0) (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0) .cse4 .cse5 (= |~#ldv_global_msg_list~0.offset| 0) (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|) (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse6 .cse7 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (<= 0 |~#ldv_global_msg_list~0.offset|) .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse7 (<= 0 |ULTIMATE.start_entry_point_~array~0#1.offset|) .cse8 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |~#ldv_global_msg_list~0.offset| 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-12-14 06:52:45,634 INFO L899 garLoopResultBuilder]: For program point L766-1(line 766) no Hoare annotation was computed. [2022-12-14 06:52:45,634 INFO L895 garLoopResultBuilder]: At program point alloc_17_err#1(lines 761 777) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_alloc_17_~i~0#1| 0)) (.cse14 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse0 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse1 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse15 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse2 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse16 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse5 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse6 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse17 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse7 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse18 (<= |#NULL.offset| 0)) (.cse9 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse10 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse19 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse11 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse20 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse21 (<= 0 |#NULL.offset|)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|) .cse10 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) .cse11 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|) (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|) (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|) .cse12 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|) .cse13) (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse14 .cse0 .cse1 .cse15 .cse2 .cse16 .cse5 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) .cse17 .cse8 .cse18 .cse10 .cse19 .cse20 .cse21 .cse12 .cse13) (and .cse14 .cse0 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0) .cse1 .cse15 .cse2 .cse16 .cse3 .cse4 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|) .cse5 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216) .cse6 .cse17 .cse7 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|) .cse18 .cse9 .cse10 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216) .cse19 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|) .cse11 .cse20 .cse21 .cse12 .cse13))) [2022-12-14 06:52:45,634 INFO L899 garLoopResultBuilder]: For program point L767(line 767) no Hoare annotation was computed. [2022-12-14 06:52:45,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-12-14 06:52:45,634 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 797) no Hoare annotation was computed. [2022-12-14 06:52:45,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 06:52:45,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-12-14 06:52:45,635 INFO L895 garLoopResultBuilder]: At program point alloc_17_returnLabel#1(lines 761 777) the Hoare annotation is: (let ((.cse14 (< |ULTIMATE.start_alloc_17_~i~0#1| |ULTIMATE.start_alloc_17_~len#1|))) (let ((.cse28 (<= |ULTIMATE.start_alloc_17_~array#1.offset| 0)) (.cse12 (+ |ULTIMATE.start_alloc_17_~j~0#1| 1)) (.cse7 (= |ULTIMATE.start_alloc_17_~p~0#1.offset| 0)) (.cse29 (<= |ULTIMATE.start_alloc_17_#in~array#1.offset| 0)) (.cse30 (<= 0 |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse9 (<= 0 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse31 (<= |ULTIMATE.start_alloc_17_#in~len#1| 16777216)) (.cse32 (<= 0 |ULTIMATE.start_alloc_17_#in~array#1.offset|)) (.cse33 (<= |ULTIMATE.start_alloc_17_~i~0#1| 2147483647)) (.cse11 (= |ULTIMATE.start_alloc_17_~p~0#1.base| 0)) (.cse34 (<= 0 |ULTIMATE.start_alloc_17_#in~len#1|)) (.cse37 (<= |ULTIMATE.start_alloc_17_~len#1| 16777216)) (.cse38 (<= 1 |ULTIMATE.start_alloc_17_~i~0#1|)) (.cse0 (< |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse27 (not .cse14)) (.cse1 (<= 0 |ULTIMATE.start_entry_point_~len~0#1|)) (.cse2 (<= |ULTIMATE.start_ldv_positive_#res#1| 16777216)) (.cse3 (<= 0 (+ |ULTIMATE.start_ldv_positive_~r~1#1| 2147483648))) (.cse4 (<= 0 |ULTIMATE.start_entry_point_~i~2#1|)) (.cse5 (<= 0 |ULTIMATE.start_ldv_positive_#res#1|)) (.cse6 (= |ULTIMATE.start_entry_point_~array~0#1.offset| 0)) (.cse8 (= |~#ldv_global_msg_list~0.offset| 0)) (.cse10 (<= |ULTIMATE.start_entry_point_~len~0#1| 16777216)) (.cse35 (= |ULTIMATE.start_alloc_17_#res#1| 0)) (.cse13 (<= |#NULL.offset| 0)) (.cse15 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_alloc_17_~array#1.offset|)) (.cse16 (<= |ULTIMATE.start_ldv_positive_~r~1#1| 16777216)) (.cse17 (<= |~#ldv_global_msg_list~0.base| 1)) (.cse18 (= |ULTIMATE.start_entry_point_~array~0#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse19 (= |ULTIMATE.start_alloc_17_#in~array#1.offset| |ULTIMATE.start_entry_point_~array~0#1.offset|)) (.cse20 (<= 1 |~#ldv_global_msg_list~0.base|)) (.cse21 (= |ULTIMATE.start_alloc_17_~array#1.base| |ULTIMATE.start_alloc_17_#in~array#1.base|)) (.cse22 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_entry_point_~len~0#1|)) (.cse23 (<= 0 |#NULL.offset|)) (.cse24 (<= 0 |#StackHeapBarrier|)) (.cse25 (= |ULTIMATE.start_alloc_17_#in~len#1| |ULTIMATE.start_alloc_17_~len#1|)) (.cse26 (= |#NULL.base| 0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse12 |ULTIMATE.start_alloc_17_~i~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_entry_point_~len~0#1| |ULTIMATE.start_entry_point_~i~2#1|) (= 3 |ULTIMATE.start_alloc_17_#res#1|) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse36 (+ (* |ULTIMATE.start_alloc_17_~i~0#1| 4) (- 4) |ULTIMATE.start_alloc_17_~array#1.offset|))) (and .cse27 .cse1 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse30 .cse8 .cse9 .cse31 .cse32 .cse33 .cse10 .cse34 .cse35 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_17_~array#1.base|) .cse36) |ULTIMATE.start_alloc_17_~p~0#1.offset|) .cse13 (not .cse11) .cse16 .cse37 .cse17 (<= 0 |ULTIMATE.start_alloc_17_~len#1|) .cse38 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_17_~array#1.base|) .cse36) |ULTIMATE.start_alloc_17_~p~0#1.base|) .cse20 .cse23 .cse24 .cse26)))) (and .cse1 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 (<= 0 .cse12) .cse7 .cse29 .cse30 .cse8 .cse9 .cse31 .cse32 .cse33 .cse10 .cse11 .cse34 (<= |ULTIMATE.start_alloc_17_~j~0#1| 2147483647) .cse13 .cse14 .cse16 .cse37 .cse17 .cse38 .cse0 .cse20 .cse23 .cse24 .cse26) (and (= |ULTIMATE.start_entry_point_~i~2#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 (<= |ULTIMATE.start_entry_point_~len~0#1| 0) .cse10 .cse13 .cse16 .cse17 .cse20 .cse23 .cse24 .cse26) (and .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 (= |ULTIMATE.start_alloc_17_~i~0#1| 0) .cse35 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2022-12-14 06:52:45,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 765) no Hoare annotation was computed. [2022-12-14 06:52:45,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 772) no Hoare annotation was computed. [2022-12-14 06:52:45,638 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:52:45,640 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 06:52:45,647 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,648 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,649 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,649 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,654 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,654 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,654 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,654 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,658 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,658 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,663 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,664 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,673 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,673 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,676 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,676 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,678 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,678 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,678 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,679 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,679 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,679 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,680 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,680 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 06:52:45 BoogieIcfgContainer [2022-12-14 06:52:45,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 06:52:45,681 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 06:52:45,681 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 06:52:45,681 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 06:52:45,682 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:49:57" (3/4) ... [2022-12-14 06:52:45,685 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 06:52:45,690 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-12-14 06:52:45,694 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-12-14 06:52:45,695 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-12-14 06:52:45,695 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-14 06:52:45,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && r <= 16777216) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((i == 0 && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list]) && unknown-#length-unknown[1] == 8) && 0 <= r + 2147483648) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && ldv_global_msg_list == 0) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && \valid[1] == 1) && len < 16777216) && ((r == \result && 0 < r) || (!(0 < r) && \result == 1))) && ldv_global_msg_list == 1) && \valid[0] == 0) && \result == len) && #NULL == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] == ldv_global_msg_list) [2022-12-14 06:52:45,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && p == 0) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && p == 0) && i == 0) && i < len) && array == array) && r <= 16777216) && array == array) && len < 16777216) && array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-12-14 06:52:45,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && j + 1 <= 0) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && len <= 16777216) && p == 0) && i == 0) && j + 1 == i) && #NULL <= 0) && i < len) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && len < 16777216) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-12-14 06:52:45,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && 0 <= \old(len)) && r <= 16777216) && len <= 16777216) && 0 <= len) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && ((((((i == 0 && array == array) && array == array) && \old(len) == len) && \old(len) == len) && !(i < len)) || (((#memory_$Pointer$[array][i * 4 + -4 + array] == p && !(p == 0)) && 1 <= i) && #memory_$Pointer$[array][i * 4 + -4 + array] == p))) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && i == 0) && array == array) && r <= 16777216) && 0 <= len) && len < 16777216) && array == array) && ldv_global_msg_list == 1) && #NULL == 0) && ((((((i == 0 && array == array) && array == array) && \old(len) == len) && \old(len) == len) && !(i < len)) || (((#memory_$Pointer$[array][i * 4 + -4 + array] == p && !(p == 0)) && 1 <= i) && #memory_$Pointer$[array][i * 4 + -4 + array] == p))) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-12-14 06:52:45,717 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((len < 16777216 && ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && 0 <= i) && len <= 16777216) && p == 0) && j + 1 == i) && #NULL <= 0) && i < len) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && len <= i) && 3 == \result) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && 0 <= \old(len)) && \result == 0) && #memory_$Pointer$[array][i * 4 + -4 + array] == p) && #NULL <= 0) && !(p == 0)) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && 1 <= i) && #memory_$Pointer$[array][i * 4 + -4 + array] == p) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0))) || ((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) [2022-12-14 06:52:45,717 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && len <= i) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && array == array) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && array == array) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && array == array) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && \old(len) == len) && 0 <= #NULL) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && \old(len) == len) && array == array) && #NULL == 0) || ((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || ((((((((((((i == 0 && ((((((((((((((((((((((((((1 <= i && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= \result) && array <= 0) && 0 <= len) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= array) && p == 0) && \old(len) <= 16777216) && 0 <= \old(len)) && i <= 2147483647) && r <= 16777216) && j + 1 <= 0) && ldv_global_msg_list == 1) && 3 == \result) && #NULL == 0) && 0 <= array) && 0 <= array) && array <= 0) || (((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && p == 0) && array <= 0) && ldv_global_msg_list == 0) && array == array) && 0 <= array) && p == 0) && j + 1 == i) && array == array) && array == array) && r <= 16777216) && array == array) && array == array) && ldv_global_msg_list == 1) && 3 == \result) && #NULL == 0) && \old(len) == len) && \old(len) == len) && i == 0) && array == array))) && i < len) && array == array) && len <= i) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array <= 0) && 0 <= len) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && 0 <= \old(len)) && \old(len) <= 16777216) && \result == 0) && #NULL <= 0) && 0 <= \old(len)) && i <= 2147483647) && 0 <= i) && r <= 16777216) && len <= 16777216) && ((((#memory_$Pointer$[array][i * 4 + -4 + array] == p && !(p == 0)) && 1 <= i) && #memory_$Pointer$[array][i * 4 + -4 + array] == p) || ((((i == 0 && array == array) && array == array) && \old(len) == len) && \old(len) == len))) && ldv_global_msg_list <= 1) && 0 <= len) && 1 <= ldv_global_msg_list) && 0 <= array) && 0 <= #NULL) && 0 <= array) && 0 <= unknown-#StackHeapBarrier-unknown) && array <= 0) && #NULL == 0)) && len < 16777216) && len <= 16777215)) || ((((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && len <= 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((0 <= len && len <= 2) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && #NULL <= 0) && i <= 2) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && len <= i) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-12-14 06:52:45,727 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 06:52:45,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 06:52:45,728 INFO L158 Benchmark]: Toolchain (without parser) took 168999.06ms. Allocated memory was 140.5MB in the beginning and 520.1MB in the end (delta: 379.6MB). Free memory was 110.4MB in the beginning and 233.8MB in the end (delta: -123.4MB). Peak memory consumption was 256.8MB. Max. memory is 16.1GB. [2022-12-14 06:52:45,728 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:52:45,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.20ms. Allocated memory is still 140.5MB. Free memory was 110.4MB in the beginning and 88.1MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 06:52:45,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.84ms. Allocated memory is still 140.5MB. Free memory was 88.1MB in the beginning and 85.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:52:45,728 INFO L158 Benchmark]: Boogie Preprocessor took 28.18ms. Allocated memory is still 140.5MB. Free memory was 85.9MB in the beginning and 84.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:52:45,728 INFO L158 Benchmark]: RCFGBuilder took 376.41ms. Allocated memory is still 140.5MB. Free memory was 84.2MB in the beginning and 109.8MB in the end (delta: -25.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-12-14 06:52:45,729 INFO L158 Benchmark]: TraceAbstraction took 168038.62ms. Allocated memory was 140.5MB in the beginning and 520.1MB in the end (delta: 379.6MB). Free memory was 109.6MB in the beginning and 237.9MB in the end (delta: -128.4MB). Peak memory consumption was 314.1MB. Max. memory is 16.1GB. [2022-12-14 06:52:45,729 INFO L158 Benchmark]: Witness Printer took 46.44ms. Allocated memory is still 520.1MB. Free memory was 237.9MB in the beginning and 233.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 06:52:45,730 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.20ms. Allocated memory is still 111.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.20ms. Allocated memory is still 140.5MB. Free memory was 110.4MB in the beginning and 88.1MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.84ms. Allocated memory is still 140.5MB. Free memory was 88.1MB in the beginning and 85.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.18ms. Allocated memory is still 140.5MB. Free memory was 85.9MB in the beginning and 84.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.41ms. Allocated memory is still 140.5MB. Free memory was 84.2MB in the beginning and 109.8MB in the end (delta: -25.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 168038.62ms. Allocated memory was 140.5MB in the beginning and 520.1MB in the end (delta: 379.6MB). Free memory was 109.6MB in the beginning and 237.9MB in the end (delta: -128.4MB). Peak memory consumption was 314.1MB. Max. memory is 16.1GB. * Witness Printer took 46.44ms. Allocated memory is still 520.1MB. Free memory was 237.9MB in the beginning and 233.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 790]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 790]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 765]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 772]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 780]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 780]: 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, 36 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 167.9s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 128.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 963 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 953 mSDsluCounter, 2265 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1754 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2637 IncrementalHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 511 mSDtfsCounter, 2637 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1020 GetRequests, 611 SyntacticMatches, 44 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2250 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=19, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 262 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 18 PreInvPairs, 69 NumberOfFragments, 2535 HoareAnnotationTreeSize, 18 FomulaSimplifications, 148396 FormulaSimplificationTreeSizeReduction, 123.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1517882 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 887 NumberOfCodeBlocks, 868 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1071 ConstructedInterpolants, 0 QuantifiedInterpolants, 2169 SizeOfPredicates, 63 NumberOfNonLiveVariables, 2462 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 46 InterpolantComputations, 13 PerfectInterpolantSequences, 322/416 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: 4.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 111, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 201, TOOLS_POST_TIME: 2.7s, TOOLS_POST_CALL_APPLICATIONS: 44, TOOLS_POST_CALL_TIME: 1.0s, TOOLS_POST_RETURN_APPLICATIONS: 34, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 276, TOOLS_QUANTIFIERELIM_TIME: 4.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 445, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 42, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 16, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 29, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 111, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 13, LOOP_SUMMARIZER_CACHE_MISSES: 13, LOOP_SUMMARIZER_OVERALL_TIME: 2.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 29, CALL_SUMMARIZER_APPLICATIONS: 34, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, 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: 1613, DAG_COMPRESSION_RETAINED_NODES: 360, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 765]: Loop Invariant [2022-12-14 06:52:45,735 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,736 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,736 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,736 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,737 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,737 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,737 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,737 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && 0 <= \old(len)) && r <= 16777216) && len <= 16777216) && 0 <= len) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && ((((((i == 0 && array == array) && array == array) && \old(len) == len) && \old(len) == len) && !(i < len)) || (((#memory_$Pointer$[array][i * 4 + -4 + array] == p && !(p == 0)) && 1 <= i) && #memory_$Pointer$[array][i * 4 + -4 + array] == p))) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && i == 0) && array == array) && r <= 16777216) && 0 <= len) && len < 16777216) && array == array) && ldv_global_msg_list == 1) && #NULL == 0) && ((((((i == 0 && array == array) && array == array) && \old(len) == len) && \old(len) == len) && !(i < len)) || (((#memory_$Pointer$[array][i * 4 + -4 + array] == p && !(p == 0)) && 1 <= i) && #memory_$Pointer$[array][i * 4 + -4 + array] == p))) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 780]: Loop Invariant [2022-12-14 06:52:45,739 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,739 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,741 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,742 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && len <= i) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && array == array) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && array == array) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && array == array) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && \old(len) == len) && 0 <= #NULL) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && \old(len) == len) && array == array) && #NULL == 0) || ((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || ((((((((((((i == 0 && ((((((((((((((((((((((((((1 <= i && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= \result) && array <= 0) && 0 <= len) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= array) && p == 0) && \old(len) <= 16777216) && 0 <= \old(len)) && i <= 2147483647) && r <= 16777216) && j + 1 <= 0) && ldv_global_msg_list == 1) && 3 == \result) && #NULL == 0) && 0 <= array) && 0 <= array) && array <= 0) || (((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && p == 0) && array <= 0) && ldv_global_msg_list == 0) && array == array) && 0 <= array) && p == 0) && j + 1 == i) && array == array) && array == array) && r <= 16777216) && array == array) && array == array) && ldv_global_msg_list == 1) && 3 == \result) && #NULL == 0) && \old(len) == len) && \old(len) == len) && i == 0) && array == array))) && i < len) && array == array) && len <= i) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array <= 0) && 0 <= len) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && 0 <= \old(len)) && \old(len) <= 16777216) && \result == 0) && #NULL <= 0) && 0 <= \old(len)) && i <= 2147483647) && 0 <= i) && r <= 16777216) && len <= 16777216) && ((((#memory_$Pointer$[array][i * 4 + -4 + array] == p && !(p == 0)) && 1 <= i) && #memory_$Pointer$[array][i * 4 + -4 + array] == p) || ((((i == 0 && array == array) && array == array) && \old(len) == len) && \old(len) == len))) && ldv_global_msg_list <= 1) && 0 <= len) && 1 <= ldv_global_msg_list) && 0 <= array) && 0 <= #NULL) && 0 <= array) && 0 <= unknown-#StackHeapBarrier-unknown) && array <= 0) && #NULL == 0)) && len < 16777216) && len <= 16777215)) || ((((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && len <= 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && i == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((0 <= len && len <= 2) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && #NULL <= 0) && i <= 2) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && len <= i) && len <= 16777215) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\result <= 16777216 && 0 <= r + 2147483648) && 0 <= \result) && p == 0) && array <= 0) && ldv_global_msg_list == 0) && 0 <= array) && p == 0) && i == 0) && i < len) && array == array) && r <= 16777216) && array == array) && len < 16777216) && array == array) && len <= i) && ldv_global_msg_list == 1) && #NULL == 0) && array == array) && \old(len) == len) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && i == 0) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && j + 1 <= 0) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && len <= 16777216) && p == 0) && i == 0) && j + 1 == i) && #NULL <= 0) && i < len) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && len < 16777216) && array == array) && len <= i) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0)) || ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && \old(len) <= 16777216) && 0 <= array) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 761]: Loop Invariant [2022-12-14 06:52:45,747 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,747 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,749 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,749 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((len < 16777216 && ((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && ldv_global_msg_list == 0) && 0 <= i) && len <= 16777216) && p == 0) && j + 1 == i) && #NULL <= 0) && i < len) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && len <= i) && 3 == \result) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) || (((((((((((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && 0 <= \old(len)) && \result == 0) && #memory_$Pointer$[array][i * 4 + -4 + array] == p) && #NULL <= 0) && !(p == 0)) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 0 <= len) && 1 <= i) && #memory_$Pointer$[array][i * 4 + -4 + array] == p) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0))) || ((((((((((((((((((((((((((((((0 <= len && \result <= 16777216) && array <= 0) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && 0 <= j + 1) && p == 0) && array <= 0) && 0 <= array) && ldv_global_msg_list == 0) && 0 <= i) && \old(len) <= 16777216) && 0 <= array) && i <= 2147483647) && len <= 16777216) && p == 0) && 0 <= \old(len)) && j <= 2147483647) && #NULL <= 0) && i < len) && r <= 16777216) && len <= 16777216) && ldv_global_msg_list <= 1) && 1 <= i) && len < 16777216) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((i == 0 && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 0) && len <= 16777216) && #NULL <= 0) && r <= 16777216) && ldv_global_msg_list <= 1) && 1 <= ldv_global_msg_list) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((!(i < len) && 0 <= len) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= i) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && len <= 16777216) && i == 0) && \result == 0) && #NULL <= 0) && array == array) && r <= 16777216) && ldv_global_msg_list <= 1) && array == array) && array == array) && 1 <= ldv_global_msg_list) && array == array) && \old(len) == len) && 0 <= #NULL) && 0 <= unknown-#StackHeapBarrier-unknown) && \old(len) == len) && #NULL == 0) - InvariantResult [Line: 790]: Loop Invariant [2022-12-14 06:52:45,751 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,751 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,751 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,751 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,752 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,752 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 06:52:45,752 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 06:52:45,752 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((0 <= len && 1 <= i) && \result <= 16777216) && 0 <= r + 2147483648) && 0 <= \result) && array == 0) && ldv_global_msg_list == 0) && r <= 16777216) && len < 16777216) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((i == 0 && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list]) && unknown-#length-unknown[1] == 8) && 0 <= r + 2147483648) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && array == 0) && ldv_global_msg_list == 0) && ldv_global_msg_list == #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list + 4]) && \valid[1] == 1) && len < 16777216) && ((r == \result && 0 < r) || (!(0 < r) && \result == 1))) && ldv_global_msg_list == 1) && \valid[0] == 0) && \result == len) && #NULL == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #memory_$Pointer$[ldv_global_msg_list][ldv_global_msg_list] == ldv_global_msg_list) RESULT: Ultimate proved your program to be correct! [2022-12-14 06:52:45,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c0ffe2f-e700-43e2-8040-2b54304b9bff/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE