./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:28:19,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:28:19,879 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 14:28:19,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:28:19,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:28:19,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:28:19,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:28:19,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:28:19,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:28:19,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:28:19,914 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:28:19,915 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:28:19,915 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:28:19,916 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:28:19,917 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:28:19,917 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:28:19,918 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:28:19,918 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:28:19,919 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:28:19,919 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:28:19,920 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:28:19,921 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:28:19,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:28:19,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 14:28:19,922 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:28:19,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:28:19,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:28:19,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:28:19,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 14:28:19,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:28:19,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 14:28:19,925 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 14:28:19,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:28:19,926 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:28:19,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 14:28:19,927 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:28:19,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:28:19,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:28:19,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:28:19,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:28:19,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:28:19,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:28:19,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 14:28:19,929 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:28:19,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:28:19,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:28:19,929 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 14:28:19,930 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:28:19,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:28:19,930 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/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_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2023-12-02 14:28:20,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:28:20,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:28:20,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:28:20,197 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:28:20,197 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:28:20,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2c_update_all.i [2023-12-02 14:28:23,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:28:23,537 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:28:23,538 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/sv-benchmarks/c/list-simple/dll2c_update_all.i [2023-12-02 14:28:23,556 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/data/f4c6714c3/ac9a4f0827bf4f01b4962631a542e567/FLAG567f15bd1 [2023-12-02 14:28:23,570 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/data/f4c6714c3/ac9a4f0827bf4f01b4962631a542e567 [2023-12-02 14:28:23,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:28:23,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:28:23,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:28:23,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:28:23,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:28:23,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:28:23" (1/1) ... [2023-12-02 14:28:23,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11330356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:23, skipping insertion in model container [2023-12-02 14:28:23,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:28:23" (1/1) ... [2023-12-02 14:28:23,641 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:28:23,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:28:23,944 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:28:23,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:28:24,019 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:28:24,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24 WrapperNode [2023-12-02 14:28:24,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:28:24,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:28:24,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:28:24,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:28:24,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,069 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2023-12-02 14:28:24,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:28:24,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:28:24,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:28:24,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:28:24,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:28:24,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:28:24,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:28:24,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:28:24,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (1/1) ... [2023-12-02 14:28:24,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:28:24,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:28:24,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:28:24,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:28:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 14:28:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 14:28:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 14:28:24,168 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 14:28:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 14:28:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:28:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 14:28:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 14:28:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:28:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 14:28:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:28:24,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:28:24,287 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:28:24,289 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:28:24,557 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:28:24,637 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:28:24,637 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 14:28:24,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:28:24 BoogieIcfgContainer [2023-12-02 14:28:24,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:28:24,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:28:24,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:28:24,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:28:24,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:28:23" (1/3) ... [2023-12-02 14:28:24,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e883876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:28:24, skipping insertion in model container [2023-12-02 14:28:24,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:28:24" (2/3) ... [2023-12-02 14:28:24,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e883876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:28:24, skipping insertion in model container [2023-12-02 14:28:24,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:28:24" (3/3) ... [2023-12-02 14:28:24,650 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2023-12-02 14:28:24,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:28:24,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-12-02 14:28:24,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:28:24,741 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=LoopHeads, 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;@23a06fae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:28:24,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-12-02 14:28:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 states have internal predecessors, (53), 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) [2023-12-02 14:28:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 14:28:24,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:24,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:28:24,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:24,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1066209459, now seen corresponding path program 1 times [2023-12-02 14:28:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:24,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193921086] [2023-12-02 14:28:24,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:24,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:28:25,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193921086] [2023-12-02 14:28:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193921086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:28:25,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:28:25,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:28:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426653483] [2023-12-02 14:28:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:28:25,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:28:25,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:28:25,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:28:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:28:25,176 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 states have internal predecessors, (53), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 14:28:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:28:25,258 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2023-12-02 14:28:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:28:25,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 9 [2023-12-02 14:28:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:28:25,270 INFO L225 Difference]: With dead ends: 89 [2023-12-02 14:28:25,271 INFO L226 Difference]: Without dead ends: 49 [2023-12-02 14:28:25,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:28:25,279 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:28:25,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:28:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-02 14:28:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-12-02 14:28:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 39 states have internal predecessors, (44), 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) [2023-12-02 14:28:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-12-02 14:28:25,329 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2023-12-02 14:28:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:28:25,330 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-12-02 14:28:25,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 14:28:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-12-02 14:28:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 14:28:25,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:25,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:28:25,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 14:28:25,332 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:25,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash -518766297, now seen corresponding path program 1 times [2023-12-02 14:28:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312430995] [2023-12-02 14:28:25,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 14:28:25,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:25,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312430995] [2023-12-02 14:28:25,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312430995] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:28:25,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:28:25,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:28:25,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588186599] [2023-12-02 14:28:25,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:28:25,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:28:25,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:28:25,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:28:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:28:25,523 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (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) [2023-12-02 14:28:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:28:25,617 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-12-02 14:28:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:28:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (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 13 [2023-12-02 14:28:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:28:25,619 INFO L225 Difference]: With dead ends: 49 [2023-12-02 14:28:25,620 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 14:28:25,620 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 [2023-12-02 14:28:25,622 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:28:25,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:28:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 14:28:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-02 14:28:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 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) [2023-12-02 14:28:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-12-02 14:28:25,633 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 13 [2023-12-02 14:28:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:28:25,634 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-12-02 14:28:25,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (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) [2023-12-02 14:28:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-12-02 14:28:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 14:28:25,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:25,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:28:25,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 14:28:25,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:25,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash -850523828, now seen corresponding path program 1 times [2023-12-02 14:28:25,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:25,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053166083] [2023-12-02 14:28:25,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:25,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:25,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:25,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053166083] [2023-12-02 14:28:25,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053166083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:28:25,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:28:25,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:28:25,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411690072] [2023-12-02 14:28:25,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:28:25,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:28:25,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:28:25,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:28:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:28:25,819 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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) [2023-12-02 14:28:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:28:25,929 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2023-12-02 14:28:25,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:28:25,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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 17 [2023-12-02 14:28:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:28:25,932 INFO L225 Difference]: With dead ends: 89 [2023-12-02 14:28:25,932 INFO L226 Difference]: Without dead ends: 72 [2023-12-02 14:28:25,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:28:25,935 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 59 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:28:25,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 57 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:28:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-02 14:28:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2023-12-02 14:28:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 48 states have internal predecessors, (53), 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) [2023-12-02 14:28:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-12-02 14:28:25,949 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 17 [2023-12-02 14:28:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:28:25,950 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-12-02 14:28:25,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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) [2023-12-02 14:28:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-12-02 14:28:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 14:28:25,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:25,952 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:28:25,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 14:28:25,953 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:25,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:25,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1992573862, now seen corresponding path program 1 times [2023-12-02 14:28:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:25,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153720826] [2023-12-02 14:28:25,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:25,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 14:28:26,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:26,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153720826] [2023-12-02 14:28:26,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153720826] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:28:26,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677228511] [2023-12-02 14:28:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:26,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:28:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:28:26,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:28:26,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 14:28:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:26,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:28:26,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:28:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 14:28:26,426 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:28:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677228511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:28:26,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:28:26,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 14:28:26,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911493439] [2023-12-02 14:28:26,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:28:26,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:28:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:28:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:28:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:28:26,429 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 14:28:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:28:26,508 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2023-12-02 14:28:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:28:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2023-12-02 14:28:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:28:26,510 INFO L225 Difference]: With dead ends: 92 [2023-12-02 14:28:26,510 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 14:28:26,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:28:26,513 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:28:26,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:28:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 14:28:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-02 14:28:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.46875) internal successors, (47), 43 states have internal predecessors, (47), 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) [2023-12-02 14:28:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-12-02 14:28:26,523 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 21 [2023-12-02 14:28:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:28:26,524 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-12-02 14:28:26,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 14:28:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-12-02 14:28:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 14:28:26,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:26,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:28:26,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:28:26,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:28:26,734 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:26,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1943203185, now seen corresponding path program 1 times [2023-12-02 14:28:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:26,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371351013] [2023-12-02 14:28:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:26,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:26,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:26,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371351013] [2023-12-02 14:28:26,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371351013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:28:26,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:28:26,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:28:26,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833951975] [2023-12-02 14:28:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:28:26,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:28:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:28:26,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:28:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:28:26,887 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-12-02 14:28:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:28:26,995 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2023-12-02 14:28:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:28:26,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 20 [2023-12-02 14:28:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:28:26,999 INFO L225 Difference]: With dead ends: 66 [2023-12-02 14:28:27,000 INFO L226 Difference]: Without dead ends: 64 [2023-12-02 14:28:27,000 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 [2023-12-02 14:28:27,001 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:28:27,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:28:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-02 14:28:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2023-12-02 14:28:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 48 states have internal predecessors, (55), 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) [2023-12-02 14:28:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-12-02 14:28:27,013 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 20 [2023-12-02 14:28:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:28:27,014 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-12-02 14:28:27,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-12-02 14:28:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-12-02 14:28:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 14:28:27,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:27,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:28:27,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 14:28:27,016 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:27,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1943207072, now seen corresponding path program 1 times [2023-12-02 14:28:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:27,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434565717] [2023-12-02 14:28:27,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:27,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434565717] [2023-12-02 14:28:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434565717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:28:27,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:28:27,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:28:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978821978] [2023-12-02 14:28:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:28:27,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:28:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:28:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:28:27,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:28:27,137 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-12-02 14:28:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:28:27,230 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2023-12-02 14:28:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:28:27,231 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), 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 20 [2023-12-02 14:28:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:28:27,232 INFO L225 Difference]: With dead ends: 97 [2023-12-02 14:28:27,232 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 14:28:27,233 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 [2023-12-02 14:28:27,234 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 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.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:28:27,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:28:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 14:28:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2023-12-02 14:28:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 46 states have internal predecessors, (50), 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) [2023-12-02 14:28:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-12-02 14:28:27,243 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 20 [2023-12-02 14:28:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:28:27,243 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-12-02 14:28:27,244 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), 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) [2023-12-02 14:28:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-12-02 14:28:27,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 14:28:27,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:27,245 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] [2023-12-02 14:28:27,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 14:28:27,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:27,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1898195830, now seen corresponding path program 1 times [2023-12-02 14:28:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:27,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265680127] [2023-12-02 14:28:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:27,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:27,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:27,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265680127] [2023-12-02 14:28:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265680127] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:28:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823034862] [2023-12-02 14:28:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:28:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:28:27,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:28:27,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 14:28:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:27,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:28:27,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:28:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:27,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:28:27,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823034862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:28:27,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:28:27,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2023-12-02 14:28:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873537408] [2023-12-02 14:28:27,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:28:27,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:28:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:28:27,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:28:27,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:28:27,731 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-12-02 14:28:27,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:28:27,878 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2023-12-02 14:28:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:28:27,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 23 [2023-12-02 14:28:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:28:27,880 INFO L225 Difference]: With dead ends: 60 [2023-12-02 14:28:27,880 INFO L226 Difference]: Without dead ends: 58 [2023-12-02 14:28:27,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-02 14:28:27,882 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 58 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:28:27,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 74 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:28:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-02 14:28:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2023-12-02 14:28:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 44 states have internal predecessors, (48), 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) [2023-12-02 14:28:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-12-02 14:28:27,891 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 23 [2023-12-02 14:28:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:28:27,892 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-12-02 14:28:27,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-12-02 14:28:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-12-02 14:28:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 14:28:27,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:27,894 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:28:27,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 14:28:28,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 14:28:28,101 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:28,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:28,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1285471340, now seen corresponding path program 1 times [2023-12-02 14:28:28,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:28,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425258845] [2023-12-02 14:28:28,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:28,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:28,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:28,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425258845] [2023-12-02 14:28:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425258845] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:28:28,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888116229] [2023-12-02 14:28:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:28,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:28:28,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:28:28,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:28:28,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 14:28:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:28,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:28:28,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:28:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:28,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:28:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888116229] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:28:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65042987] [2023-12-02 14:28:28,775 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 14:28:28,775 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:28:28,779 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:28:28,786 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:28:28,789 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:28:30,752 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 14:28:30,765 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:28:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [65042987] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:28:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:28:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 5, 5] total 26 [2023-12-02 14:28:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084981188] [2023-12-02 14:28:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:28:40,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 14:28:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:28:40,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 14:28:40,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=555, Unknown=3, NotChecked=0, Total=702 [2023-12-02 14:28:40,450 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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) [2023-12-02 14:28:44,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:28:46,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:28:48,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:28:50,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:28:52,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:28:54,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:28:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:28:54,994 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2023-12-02 14:28:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 14:28:54,995 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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 24 [2023-12-02 14:28:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:28:54,996 INFO L225 Difference]: With dead ends: 74 [2023-12-02 14:28:54,996 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 14:28:54,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=144, Invalid=555, Unknown=3, NotChecked=0, Total=702 [2023-12-02 14:28:54,997 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:28:54,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 6 Unknown, 0 Unchecked, 14.5s Time] [2023-12-02 14:28:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 14:28:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2023-12-02 14:28:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.358974358974359) internal successors, (53), 48 states have internal predecessors, (53), 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) [2023-12-02 14:28:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-12-02 14:28:55,006 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 24 [2023-12-02 14:28:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:28:55,006 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-12-02 14:28:55,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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) [2023-12-02 14:28:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-12-02 14:28:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 14:28:55,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:55,007 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:28:55,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 14:28:55,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:28:55,208 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:55,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1612626166, now seen corresponding path program 1 times [2023-12-02 14:28:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:55,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598346692] [2023-12-02 14:28:55,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 14:28:55,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598346692] [2023-12-02 14:28:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598346692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:28:55,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:28:55,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:28:55,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576552578] [2023-12-02 14:28:55,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:28:55,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:28:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:28:55,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:28:55,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:28:55,272 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-12-02 14:28:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:28:55,318 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-12-02 14:28:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:28:55,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 26 [2023-12-02 14:28:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:28:55,320 INFO L225 Difference]: With dead ends: 52 [2023-12-02 14:28:55,320 INFO L226 Difference]: Without dead ends: 51 [2023-12-02 14:28:55,320 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 [2023-12-02 14:28:55,321 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 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 [2023-12-02 14:28:55,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:28:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-02 14:28:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-02 14:28:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 47 states have internal predecessors, (52), 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) [2023-12-02 14:28:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-12-02 14:28:55,331 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2023-12-02 14:28:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:28:55,331 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-12-02 14:28:55,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-12-02 14:28:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-12-02 14:28:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 14:28:55,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:28:55,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:28:55,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 14:28:55,333 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:28:55,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:28:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1548196319, now seen corresponding path program 1 times [2023-12-02 14:28:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:28:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14321827] [2023-12-02 14:28:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:28:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:55,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:28:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14321827] [2023-12-02 14:28:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14321827] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:28:55,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428157750] [2023-12-02 14:28:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:28:55,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:28:55,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:28:55,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:28:55,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 14:28:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:28:55,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:28:55,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:28:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:55,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:28:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:28:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428157750] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:28:55,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835077453] [2023-12-02 14:28:55,795 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 14:28:55,795 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:28:55,796 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:28:55,796 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:28:55,796 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:28:56,785 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 14:28:56,794 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:29:05,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1835077453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:05,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:29:05,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 6, 6] total 26 [2023-12-02 14:29:05,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229345028] [2023-12-02 14:29:05,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:05,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 14:29:05,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:29:05,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 14:29:05,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=605, Unknown=2, NotChecked=0, Total=702 [2023-12-02 14:29:05,949 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2023-12-02 14:29:07,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:29:10,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:29:12,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:29:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:13,856 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-12-02 14:29:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 14:29:13,857 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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 27 [2023-12-02 14:29:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:13,857 INFO L225 Difference]: With dead ends: 54 [2023-12-02 14:29:13,857 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 14:29:13,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=95, Invalid=605, Unknown=2, NotChecked=0, Total=702 [2023-12-02 14:29:13,859 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:13,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2023-12-02 14:29:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 14:29:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-02 14:29:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 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) [2023-12-02 14:29:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-12-02 14:29:13,871 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 27 [2023-12-02 14:29:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:13,871 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-12-02 14:29:13,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2023-12-02 14:29:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-12-02 14:29:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 14:29:13,873 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:13,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:29:13,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 14:29:14,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 14:29:14,073 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:29:14,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1337455409, now seen corresponding path program 1 times [2023-12-02 14:29:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:29:14,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959645728] [2023-12-02 14:29:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:14,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:29:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:29:14,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:29:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959645728] [2023-12-02 14:29:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959645728] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:29:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279686224] [2023-12-02 14:29:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:14,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:29:14,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:29:14,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:29:14,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 14:29:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:14,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:29:14,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:29:14,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:29:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:29:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279686224] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:29:14,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1630917835] [2023-12-02 14:29:14,607 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 14:29:14,607 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:29:14,607 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:29:14,607 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:29:14,607 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:29:16,010 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 14:29:16,019 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:29:18,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1630917835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:18,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:29:18,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6, 5, 5] total 26 [2023-12-02 14:29:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367123198] [2023-12-02 14:29:18,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:18,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 14:29:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:29:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 14:29:18,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2023-12-02 14:29:18,125 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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) [2023-12-02 14:29:20,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:29:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:20,781 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-12-02 14:29:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 14:29:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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 30 [2023-12-02 14:29:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:20,782 INFO L225 Difference]: With dead ends: 63 [2023-12-02 14:29:20,782 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 14:29:20,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2023-12-02 14:29:20,783 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:20,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 90 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 14:29:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 14:29:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2023-12-02 14:29:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2023-12-02 14:29:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-12-02 14:29:20,800 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 30 [2023-12-02 14:29:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:20,800 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-12-02 14:29:20,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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) [2023-12-02 14:29:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-12-02 14:29:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 14:29:20,801 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:20,802 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 14:29:20,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-02 14:29:21,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 14:29:21,002 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:29:21,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1980086771, now seen corresponding path program 1 times [2023-12-02 14:29:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:29:21,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184912538] [2023-12-02 14:29:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:29:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:21,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:29:21,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184912538] [2023-12-02 14:29:21,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184912538] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:21,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:29:21,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54183053] [2023-12-02 14:29:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:21,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:29:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:29:21,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:29:21,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:29:21,113 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-12-02 14:29:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:21,234 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2023-12-02 14:29:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:29:21,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 36 [2023-12-02 14:29:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:21,235 INFO L225 Difference]: With dead ends: 71 [2023-12-02 14:29:21,236 INFO L226 Difference]: Without dead ends: 56 [2023-12-02 14:29:21,236 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 [2023-12-02 14:29:21,237 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:21,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 69 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:29:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-02 14:29:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2023-12-02 14:29:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.25) internal successors, (50), 45 states have internal predecessors, (50), 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) [2023-12-02 14:29:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-12-02 14:29:21,255 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 36 [2023-12-02 14:29:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:21,255 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-12-02 14:29:21,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-12-02 14:29:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-12-02 14:29:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 14:29:21,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:21,256 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-12-02 14:29:21,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 14:29:21,257 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:29:21,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1253052041, now seen corresponding path program 1 times [2023-12-02 14:29:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:29:21,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057900507] [2023-12-02 14:29:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:29:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:21,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:29:21,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057900507] [2023-12-02 14:29:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057900507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:21,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:21,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:29:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325051602] [2023-12-02 14:29:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:21,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:29:21,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:29:21,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:29:21,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:29:21,369 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-12-02 14:29:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:21,491 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2023-12-02 14:29:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:29:21,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 37 [2023-12-02 14:29:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:21,493 INFO L225 Difference]: With dead ends: 56 [2023-12-02 14:29:21,493 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 14:29:21,493 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 [2023-12-02 14:29:21,494 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:21,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 65 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:29:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 14:29:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2023-12-02 14:29:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 48 states have internal predecessors, (53), 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) [2023-12-02 14:29:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-12-02 14:29:21,511 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 37 [2023-12-02 14:29:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:21,511 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-12-02 14:29:21,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-12-02 14:29:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-12-02 14:29:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 14:29:21,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:21,513 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1] [2023-12-02 14:29:21,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 14:29:21,513 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:29:21,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2112440996, now seen corresponding path program 1 times [2023-12-02 14:29:21,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:29:21,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666384684] [2023-12-02 14:29:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:21,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:29:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:21,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:29:21,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666384684] [2023-12-02 14:29:21,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666384684] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:29:21,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687225239] [2023-12-02 14:29:21,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:21,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:29:21,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:29:21,699 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:29:21,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 14:29:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:21,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:29:21,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:21,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:29:21,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687225239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:21,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:29:21,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2023-12-02 14:29:21,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258146459] [2023-12-02 14:29:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:21,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:29:21,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:29:21,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:29:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:29:22,000 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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) [2023-12-02 14:29:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:22,127 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-12-02 14:29:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:29:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 40 [2023-12-02 14:29:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:22,128 INFO L225 Difference]: With dead ends: 54 [2023-12-02 14:29:22,128 INFO L226 Difference]: Without dead ends: 52 [2023-12-02 14:29:22,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-02 14:29:22,129 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:22,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 48 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:29:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-02 14:29:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-12-02 14:29:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 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) [2023-12-02 14:29:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-12-02 14:29:22,146 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2023-12-02 14:29:22,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:22,146 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-12-02 14:29:22,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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) [2023-12-02 14:29:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-12-02 14:29:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 14:29:22,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:22,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1] [2023-12-02 14:29:22,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 14:29:22,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:29:22,348 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:29:22,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1061161321, now seen corresponding path program 1 times [2023-12-02 14:29:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:29:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17750861] [2023-12-02 14:29:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:29:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:22,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:29:22,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17750861] [2023-12-02 14:29:22,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17750861] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:29:22,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353965643] [2023-12-02 14:29:22,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:22,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:29:22,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:29:22,524 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:29:22,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 14:29:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:22,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:29:22,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:22,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:29:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:23,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353965643] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:29:23,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1269804338] [2023-12-02 14:29:23,039 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 14:29:23,039 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:29:23,040 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:29:23,040 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:29:23,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:29:25,559 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 14:29:25,570 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:29:30,610 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3228#(and (<= 2147483648 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))' at error location [2023-12-02 14:29:30,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:29:30,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:29:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-02 14:29:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077376649] [2023-12-02 14:29:30,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:29:30,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 14:29:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:29:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 14:29:30,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=903, Unknown=3, NotChecked=0, Total=1122 [2023-12-02 14:29:30,614 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 14:29:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:30,820 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2023-12-02 14:29:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 14:29:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2023-12-02 14:29:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:30,821 INFO L225 Difference]: With dead ends: 53 [2023-12-02 14:29:30,821 INFO L226 Difference]: Without dead ends: 51 [2023-12-02 14:29:30,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=262, Invalid=1067, Unknown=3, NotChecked=0, Total=1332 [2023-12-02 14:29:30,823 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 77 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:30,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 71 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:29:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-02 14:29:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2023-12-02 14:29:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 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) [2023-12-02 14:29:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-12-02 14:29:30,836 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 41 [2023-12-02 14:29:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:30,837 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-12-02 14:29:30,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 14:29:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-12-02 14:29:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 14:29:30,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:30,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1] [2023-12-02 14:29:30,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 14:29:31,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:29:31,038 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:29:31,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1868776359, now seen corresponding path program 1 times [2023-12-02 14:29:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:29:31,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324237389] [2023-12-02 14:29:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:31,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:29:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 14:29:31,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:29:31,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324237389] [2023-12-02 14:29:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324237389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:31,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:29:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:29:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956021954] [2023-12-02 14:29:31,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:31,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:29:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:29:31,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:29:31,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:29:31,112 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-12-02 14:29:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:31,177 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2023-12-02 14:29:31,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:29:31,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 43 [2023-12-02 14:29:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:31,179 INFO L225 Difference]: With dead ends: 45 [2023-12-02 14:29:31,179 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 14:29:31,179 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 [2023-12-02 14:29:31,180 INFO L413 NwaCegarLoop]: 23 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, 44 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 [2023-12-02 14:29:31,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:29:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 14:29:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-02 14:29:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 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) [2023-12-02 14:29:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-12-02 14:29:31,194 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 43 [2023-12-02 14:29:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:31,194 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-12-02 14:29:31,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-12-02 14:29:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-12-02 14:29:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 14:29:31,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:31,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1] [2023-12-02 14:29:31,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 14:29:31,195 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:29:31,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2097492153, now seen corresponding path program 1 times [2023-12-02 14:29:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:29:31,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554920555] [2023-12-02 14:29:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:29:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:31,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:29:31,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554920555] [2023-12-02 14:29:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554920555] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:29:31,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916167174] [2023-12-02 14:29:31,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:31,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:29:31,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:29:31,371 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:29:31,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 14:29:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:31,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:29:31,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:31,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:29:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:31,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916167174] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:29:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2132246182] [2023-12-02 14:29:31,828 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 14:29:31,828 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:29:31,828 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:29:31,829 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:29:31,829 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:29:34,217 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 14:29:34,227 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:29:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2132246182] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:29:40,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 33 [2023-12-02 14:29:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2843034] [2023-12-02 14:29:40,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:40,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 14:29:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:29:40,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 14:29:40,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=967, Unknown=5, NotChecked=0, Total=1122 [2023-12-02 14:29:40,007 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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) [2023-12-02 14:29:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:41,527 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2023-12-02 14:29:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 14:29:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 44 [2023-12-02 14:29:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:41,529 INFO L225 Difference]: With dead ends: 61 [2023-12-02 14:29:41,529 INFO L226 Difference]: Without dead ends: 60 [2023-12-02 14:29:41,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 96 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=159, Invalid=1026, Unknown=5, NotChecked=0, Total=1190 [2023-12-02 14:29:41,530 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:41,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 30 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 467 Invalid, 4 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 14:29:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-02 14:29:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2023-12-02 14:29:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 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) [2023-12-02 14:29:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-12-02 14:29:41,548 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 44 [2023-12-02 14:29:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:41,548 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-12-02 14:29:41,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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) [2023-12-02 14:29:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-12-02 14:29:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 14:29:41,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:29:41,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1] [2023-12-02 14:29:41,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 14:29:41,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 14:29:41,750 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 14:29:41,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:29:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1090582679, now seen corresponding path program 1 times [2023-12-02 14:29:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:29:41,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822753564] [2023-12-02 14:29:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:41,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:29:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:41,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:29:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822753564] [2023-12-02 14:29:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822753564] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:29:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540276998] [2023-12-02 14:29:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:29:41,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:29:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:29:41,894 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:29:41,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 14:29:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:29:42,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 14:29:42,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:29:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:42,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:29:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 14:29:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540276998] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:29:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1782102036] [2023-12-02 14:29:42,285 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 14:29:42,285 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:29:42,286 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:29:42,286 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:29:42,286 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:29:44,247 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 14:29:44,254 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:29:49,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1782102036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:29:49,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:29:49,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [8, 8, 8] total 31 [2023-12-02 14:29:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113449805] [2023-12-02 14:29:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:29:49,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 14:29:49,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:29:49,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 14:29:49,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=822, Unknown=4, NotChecked=0, Total=930 [2023-12-02 14:29:49,014 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 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) [2023-12-02 14:29:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:29:50,456 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2023-12-02 14:29:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 14:29:50,457 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 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 47 [2023-12-02 14:29:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:29:50,457 INFO L225 Difference]: With dead ends: 53 [2023-12-02 14:29:50,457 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 14:29:50,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=112, Invalid=876, Unknown=4, NotChecked=0, Total=992 [2023-12-02 14:29:50,459 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:29:50,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 480 Invalid, 3 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 14:29:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 14:29:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 14:29:50,460 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) [2023-12-02 14:29:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 14:29:50,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2023-12-02 14:29:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:29:50,460 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 14:29:50,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 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) [2023-12-02 14:29:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 14:29:50,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 14:29:50,463 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2023-12-02 14:29:50,463 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2023-12-02 14:29:50,463 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2023-12-02 14:29:50,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2023-12-02 14:29:50,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2023-12-02 14:29:50,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2023-12-02 14:29:50,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2023-12-02 14:29:50,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2023-12-02 14:29:50,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2023-12-02 14:29:50,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2023-12-02 14:29:50,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2023-12-02 14:29:50,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2023-12-02 14:29:50,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2023-12-02 14:29:50,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2023-12-02 14:29:50,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-02 14:29:50,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 14:29:50,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 14:29:59,851 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 227 DAG size of output: 96 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 14:30:08,735 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 183 DAG size of output: 62 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 14:30:10,376 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2023-12-02 14:30:10,376 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2023-12-02 14:30:10,377 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (exists ((|v_#memory_int_329| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |#memory_int| (store |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 8 1))) (= (store |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 4 (select .cse0 4))) |v_#memory_int_48|) (= |v_#memory_int_47| (store |v_#memory_int_329| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_329| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse1 0))))))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (exists ((|v_#valid_68| (Array Int Int))) (and (= (store |v_#valid_68| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#valid|) (= (select |v_#valid_68| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (exists ((|v_#length_60| (Array Int Int))) (= |#length| (store |v_#length_60| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 12))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_146| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_146| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (exists ((|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_146| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_146| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_circular_create_~data#1| 1) (exists ((|v_#memory_int_BEFORE_CALL_74| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_int_BEFORE_CALL_74| 1))) (and (= (select .cse2 1) 0) (= (select .cse2 0) 48))))) [2023-12-02 14:30:10,377 INFO L899 garLoopResultBuilder]: For program point L622-1(line 622) no Hoare annotation was computed. [2023-12-02 14:30:10,377 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-12-02 14:30:10,377 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 626 645) no Hoare annotation was computed. [2023-12-02 14:30:10,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2023-12-02 14:30:10,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2023-12-02 14:30:10,377 INFO L899 garLoopResultBuilder]: For program point L631-3(line 631) no Hoare annotation was computed. [2023-12-02 14:30:10,377 INFO L899 garLoopResultBuilder]: For program point L631-4(line 631) no Hoare annotation was computed. [2023-12-02 14:30:10,378 INFO L895 garLoopResultBuilder]: At program point L631-5(lines 631 634) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3 .cse4) (let ((.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_#memory_$Pointer$.offset_84| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (let ((.cse5 (store |v_#memory_$Pointer$.offset_84| .cse6 (store (select |v_#memory_$Pointer$.offset_84| .cse6) 0 0)))) (store .cse5 |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse5 |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0))))) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse1 .cse2 (exists ((|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (let ((.cse7 (store |v_#memory_$Pointer$.base_84| .cse6 (store (select |v_#memory_$Pointer$.base_84| .cse6) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse7 |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse6))))) .cse3 (exists ((|v_#memory_int_156| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_156| .cse6 (store (select |v_#memory_int_156| .cse6) 0 (select (select |v_#memory_int_71| .cse6) 0))) |v_#memory_int_71|) (= |#memory_int| (store |v_#memory_int_71| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))))) .cse4)))) [2023-12-02 14:30:10,378 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2023-12-02 14:30:10,378 INFO L899 garLoopResultBuilder]: For program point L615(line 615) no Hoare annotation was computed. [2023-12-02 14:30:10,378 INFO L899 garLoopResultBuilder]: For program point L615-1(line 615) no Hoare annotation was computed. [2023-12-02 14:30:10,378 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2023-12-02 14:30:10,378 INFO L899 garLoopResultBuilder]: For program point L632(line 632) no Hoare annotation was computed. [2023-12-02 14:30:10,378 INFO L899 garLoopResultBuilder]: For program point L632-1(line 632) no Hoare annotation was computed. [2023-12-02 14:30:10,378 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2023-12-02 14:30:10,379 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 14:30:10,379 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2023-12-02 14:30:10,379 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2023-12-02 14:30:10,379 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2023-12-02 14:30:10,379 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-12-02 14:30:10,379 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2023-12-02 14:30:10,379 INFO L899 garLoopResultBuilder]: For program point L635-3(line 635) no Hoare annotation was computed. [2023-12-02 14:30:10,379 INFO L899 garLoopResultBuilder]: For program point L635-4(line 635) no Hoare annotation was computed. [2023-12-02 14:30:10,379 INFO L895 garLoopResultBuilder]: At program point L635-5(lines 635 640) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (or (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_84| Int)) (let ((.cse0 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2))) (or (and (= |v_ULTIMATE.start_main_~i~0#1_84| 0) .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= 2 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (and .cse0 (= 2 |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |v_ULTIMATE.start_main_~i~0#1_84| 1) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 8)))))))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2023-12-02 14:30:10,379 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2023-12-02 14:30:10,380 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))) [2023-12-02 14:30:10,380 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-02 14:30:10,380 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 14:30:10,380 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-12-02 14:30:10,380 INFO L899 garLoopResultBuilder]: For program point L636(line 636) no Hoare annotation was computed. [2023-12-02 14:30:10,380 INFO L899 garLoopResultBuilder]: For program point L636-1(line 636) no Hoare annotation was computed. [2023-12-02 14:30:10,380 INFO L899 garLoopResultBuilder]: For program point L595(line 595) no Hoare annotation was computed. [2023-12-02 14:30:10,380 INFO L899 garLoopResultBuilder]: For program point L595-1(line 595) no Hoare annotation was computed. [2023-12-02 14:30:10,380 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2023-12-02 14:30:10,381 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0)) (.cse7 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|)) (.cse9 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0)) (.cse3 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse6 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 (exists ((|v_#memory_$Pointer$.offset_84| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (let ((.cse4 (store |v_#memory_$Pointer$.offset_84| .cse5 (store (select |v_#memory_$Pointer$.offset_84| .cse5) 0 0)))) (store .cse4 |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse4 |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0))))) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse6 (= 2 |ULTIMATE.start_dll_circular_update_at_#in~data#1|) .cse7 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 0) .cse8 .cse9 (exists ((|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (let ((.cse10 (store |v_#memory_$Pointer$.base_84| .cse5 (store (select |v_#memory_$Pointer$.base_84| .cse5) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse10 |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse5))))) (= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse11 (exists ((|v_#memory_int_156| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_156| .cse5 (store (select |v_#memory_int_156| .cse5) 0 (select (select |v_#memory_int_71| .cse5) 0))) |v_#memory_int_71|) (= |#memory_int| (store |v_#memory_int_71| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))))) .cse12)) (and .cse1 .cse2 (let ((.cse13 (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse14 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1)) (.cse15 (= 3 |ULTIMATE.start_dll_circular_update_at_#in~data#1|)) (.cse16 (= 3 |ULTIMATE.start_main_~new_data~0#1|))) (or (and .cse13 .cse3 .cse14 .cse15 .cse16 .cse9 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (and (= |ULTIMATE.start_dll_circular_update_at_~index#1| 1) .cse13 .cse14 .cse15 .cse16 .cse7 .cse9))) (= |ULTIMATE.start_main_~i~0#1| 1) (or .cse0 .cse3) .cse6 .cse8 .cse11 .cse12))) [2023-12-02 14:30:10,381 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2023-12-02 14:30:10,381 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2023-12-02 14:30:10,381 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-12-02 14:30:10,382 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_dll_circular_create_~data#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_#memory_int_329| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse9 (select |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |#memory_int| (store |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse8 8 1))) (= (store |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse9 4 (select .cse8 4))) |v_#memory_int_48|) (= |v_#memory_int_47| (store |v_#memory_int_329| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_329| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse9 0))))))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (exists ((|v_#valid_68| (Array Int Int))) (and (= (store |v_#valid_68| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#valid|) (= (select |v_#valid_68| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (exists ((|v_#length_60| (Array Int Int))) (= |#length| (store |v_#length_60| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 12))) .cse4 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_146| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_146| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))))) .cse5 .cse6 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (exists ((|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_146| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_146| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) |#memory_$Pointer$.base|)) .cse7 (exists ((|v_#memory_int_BEFORE_CALL_74| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_int_BEFORE_CALL_74| 1))) (and (= (select .cse10 1) 0) (= (select .cse10 0) 48))))))) [2023-12-02 14:30:10,382 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2023-12-02 14:30:10,383 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse2 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2)) (.cse3 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse0 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|)) (.cse9 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|)) (.cse10 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (exists ((|v_ULTIMATE.start_main_~expected~0#1_31| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22| Int)) (and .cse1 .cse2 .cse3 (= |v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22| 2) .cse4 (= |v_ULTIMATE.start_main_~expected~0#1_31| 2) .cse5 .cse6 .cse7)) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) .cse8 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) .cse9 .cse10 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) (and (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (exists ((|v_ULTIMATE.start_main_~expected~0#1_31| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22| Int)) (let ((.cse11 (= |ULTIMATE.start_main_~i~0#1| 0))) (and (or .cse11 .cse2) (or (and .cse1 .cse3 (= |v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22| 2) .cse4 (= |v_ULTIMATE.start_main_~expected~0#1_31| 2) .cse5 .cse6 .cse7) (and .cse1 .cse11 .cse4 .cse5 .cse6 .cse7))))) .cse0 .cse8 .cse9 .cse10 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|)))) [2023-12-02 14:30:10,383 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-12-02 14:30:10,383 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-02 14:30:10,383 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: true [2023-12-02 14:30:10,383 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-12-02 14:30:10,386 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:30:10,389 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 14:30:10,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:30:10,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_84 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated [2023-12-02 14:30:10,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 14:30:10,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 14:30:10,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 14:30:10,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_84 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]]) could not be translated [2023-12-02 14:30:10,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 14:30:10,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_156 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_156[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_156[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] == v_#memory_int_71 && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated [2023-12-02 14:30:10,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 14:30:10,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 14:30:10,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][0] could not be translated [2023-12-02 14:30:10,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][0] could not be translated [2023-12-02 14:30:10,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 14:30:10,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 14:30:10,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:30:10,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 14:30:10,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_84 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated [2023-12-02 14:30:10,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_84 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]]) could not be translated [2023-12-02 14:30:10,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_156 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_156[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_156[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] == v_#memory_int_71 && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated [2023-12-02 14:30:10,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_84 : int :: ((((v_ULTIMATE.start_main_~i~0#1_84 == 0 && #memory_int[~s~0!base][8] == 2) && ~i~0 == 1) && 2 == ~expected~0) && 2 == #res) || (((((#memory_int[~s~0!base][8] == 2 && 2 == ~i~0) && 3 == #res) && 3 == ~expected~0) && v_ULTIMATE.start_main_~i~0#1_84 == 1) && 3 == #memory_int[#memory_$Pointer$.base[~s~0!base][0]][#memory_$Pointer$.offset[~s~0!base][0] + 8])) could not be translated [2023-12-02 14:30:10,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_329 : [int,int]int, v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int :: (#memory_int == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][8 := 1]] && v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][4 := v_#memory_int_48[~head~0!base][4]]] == v_#memory_int_48) && v_#memory_int_47 == v_#memory_int_329[~head~0!base := v_#memory_int_329[~head~0!base][0 := v_#memory_int_47[~head~0!base][0]]]) could not be translated [2023-12-02 14:30:10,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_68 : [int]int :: v_#valid_68[~head~0!base := 1] == #valid && v_#valid_68[~head~0!base] == 0) could not be translated [2023-12-02 14:30:10,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_60 : [int]int :: #length == v_#length_60[~head~0!base := 12]) could not be translated [2023-12-02 14:30:10,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_146 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_146[~head~0!base := v_#memory_$Pointer$.offset_146[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated [2023-12-02 14:30:10,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_146 : [int,int]int :: v_#memory_$Pointer$.base_146[~head~0!base := v_#memory_$Pointer$.base_146[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]] == #memory_$Pointer$.base) could not be translated [2023-12-02 14:30:10,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_BEFORE_CALL_74 : [int,int]int :: v_#memory_int_BEFORE_CALL_74[1][1] == 0 && v_#memory_int_BEFORE_CALL_74[1][0] == 48) could not be translated [2023-12-02 14:30:10,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 14:30:10,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:30:10,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 14:30:10,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~expected~0#1_31 : int, v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22 : int :: (((((((1 <= #StackHeapBarrier && #memory_int[~s~0!base][8] == 2) && ~i~0 == 1) && v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22 == 2) && ~data~0 == 1) && v_ULTIMATE.start_main_~expected~0#1_31 == 2) && ~len~0 == 2) && #res!offset == 0) && ~s~0!offset == 0) could not be translated [2023-12-02 14:30:10,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][#in~head!offset] could not be translated [2023-12-02 14:30:10,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 14:30:10,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:30:10,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][#in~head!offset] could not be translated [2023-12-02 14:30:10,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~expected~0#1_31 : int, v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22 : int :: (~i~0 == 0 || #memory_int[~s~0!base][8] == 2) && ((((((((1 <= #StackHeapBarrier && ~i~0 == 1) && v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22 == 2) && ~data~0 == 1) && v_ULTIMATE.start_main_~expected~0#1_31 == 2) && ~len~0 == 2) && #res!offset == 0) && ~s~0!offset == 0) || (((((1 <= #StackHeapBarrier && ~i~0 == 0) && ~data~0 == 1) && ~len~0 == 2) && #res!offset == 0) && ~s~0!offset == 0))) could not be translated [2023-12-02 14:30:10,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 14:30:10,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:30:10,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 14:30:10,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 14:30:10,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:30:10,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:30:10,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:30:10 BoogieIcfgContainer [2023-12-02 14:30:10,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 14:30:10,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 14:30:10,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 14:30:10,429 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 14:30:10,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:28:24" (3/4) ... [2023-12-02 14:30:10,432 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 14:30:10,434 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-12-02 14:30:10,439 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2023-12-02 14:30:10,439 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-12-02 14:30:10,440 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 14:30:10,440 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 14:30:10,460 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (\old(len) == 2)) && (len == 1)) && (data == 1)) && (len == 2)) && (data == 1)) || ((((((\old(data) == 1) && (\old(len) == 2)) && (2 == len)) && (data == 1)) && (len == 2)) && (data == 1))) [2023-12-02 14:30:10,461 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((index == 0) && (2 == data)) && (data == 1)) && (2 == \old(data))) && (\old(index) == 0)) || ((((((3 == data) && (index == 0)) && (\old(index) == 1)) && (3 == \old(data))) || ((((index == 1) && (3 == data)) && (\old(index) == 1)) && (3 == \old(data)))) && (data == 1))) [2023-12-02 14:30:10,462 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(index) == (index + 1)) || (\old(index) == index)) [2023-12-02 14:30:10,483 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (\old(len) == 2)) && (len == 1)) && (data == 1)) && (len == 2)) && (data == 1)) || ((((((\old(data) == 1) && (\old(len) == 2)) && (2 == len)) && (data == 1)) && (len == 2)) && (data == 1))) [2023-12-02 14:30:10,486 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((index == 0) && (2 == data)) && (data == 1)) && (2 == \old(data))) && (\old(index) == 0)) || ((((((3 == data) && (index == 0)) && (\old(index) == 1)) && (3 == \old(data))) || ((((index == 1) && (3 == data)) && (\old(index) == 1)) && (3 == \old(data)))) && (data == 1))) [2023-12-02 14:30:10,486 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(index) == (index + 1)) || (\old(index) == index)) [2023-12-02 14:30:10,532 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 14:30:10,532 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 14:30:10,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 14:30:10,533 INFO L158 Benchmark]: Toolchain (without parser) took 106958.70ms. Allocated memory was 159.4MB in the beginning and 488.6MB in the end (delta: 329.3MB). Free memory was 120.2MB in the beginning and 442.6MB in the end (delta: -322.4MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2023-12-02 14:30:10,533 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 113.2MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:30:10,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.34ms. Allocated memory is still 159.4MB. Free memory was 120.2MB in the beginning and 102.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 14:30:10,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.09ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 99.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:30:10,535 INFO L158 Benchmark]: Boogie Preprocessor took 31.59ms. Allocated memory is still 159.4MB. Free memory was 99.8MB in the beginning and 98.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:30:10,535 INFO L158 Benchmark]: RCFGBuilder took 536.80ms. Allocated memory is still 159.4MB. Free memory was 98.1MB in the beginning and 119.3MB in the end (delta: -21.3MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2023-12-02 14:30:10,535 INFO L158 Benchmark]: TraceAbstraction took 105786.32ms. Allocated memory was 159.4MB in the beginning and 488.6MB in the end (delta: 329.3MB). Free memory was 118.2MB in the beginning and 448.9MB in the end (delta: -330.7MB). Peak memory consumption was 284.7MB. Max. memory is 16.1GB. [2023-12-02 14:30:10,536 INFO L158 Benchmark]: Witness Printer took 103.25ms. Allocated memory is still 488.6MB. Free memory was 448.9MB in the beginning and 442.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 14:30:10,538 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 113.2MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.34ms. Allocated memory is still 159.4MB. Free memory was 120.2MB in the beginning and 102.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.09ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 99.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.59ms. Allocated memory is still 159.4MB. Free memory was 99.8MB in the beginning and 98.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 536.80ms. Allocated memory is still 159.4MB. Free memory was 98.1MB in the beginning and 119.3MB in the end (delta: -21.3MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 105786.32ms. Allocated memory was 159.4MB in the beginning and 488.6MB in the end (delta: 329.3MB). Free memory was 118.2MB in the beginning and 448.9MB in the end (delta: -330.7MB). Peak memory consumption was 284.7MB. Max. memory is 16.1GB. * Witness Printer took 103.25ms. Allocated memory is still 488.6MB. Free memory was 448.9MB in the beginning and 442.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_84 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_84 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_156 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_156[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_156[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] == v_#memory_int_71 && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_84 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_84[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_84 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_84[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_156 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_156[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_156[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] == v_#memory_int_71 && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_84 : int :: ((((v_ULTIMATE.start_main_~i~0#1_84 == 0 && #memory_int[~s~0!base][8] == 2) && ~i~0 == 1) && 2 == ~expected~0) && 2 == #res) || (((((#memory_int[~s~0!base][8] == 2 && 2 == ~i~0) && 3 == #res) && 3 == ~expected~0) && v_ULTIMATE.start_main_~i~0#1_84 == 1) && 3 == #memory_int[#memory_$Pointer$.base[~s~0!base][0]][#memory_$Pointer$.offset[~s~0!base][0] + 8])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_329 : [int,int]int, v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int :: (#memory_int == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][8 := 1]] && v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][4 := v_#memory_int_48[~head~0!base][4]]] == v_#memory_int_48) && v_#memory_int_47 == v_#memory_int_329[~head~0!base := v_#memory_int_329[~head~0!base][0 := v_#memory_int_47[~head~0!base][0]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_68 : [int]int :: v_#valid_68[~head~0!base := 1] == #valid && v_#valid_68[~head~0!base] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_60 : [int]int :: #length == v_#length_60[~head~0!base := 12]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_146 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_146[~head~0!base := v_#memory_$Pointer$.offset_146[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_146 : [int,int]int :: v_#memory_$Pointer$.base_146[~head~0!base := v_#memory_$Pointer$.base_146[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]] == #memory_$Pointer$.base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_BEFORE_CALL_74 : [int,int]int :: v_#memory_int_BEFORE_CALL_74[1][1] == 0 && v_#memory_int_BEFORE_CALL_74[1][0] == 48) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~expected~0#1_31 : int, v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22 : int :: (((((((1 <= #StackHeapBarrier && #memory_int[~s~0!base][8] == 2) && ~i~0 == 1) && v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22 == 2) && ~data~0 == 1) && v_ULTIMATE.start_main_~expected~0#1_31 == 2) && ~len~0 == 2) && #res!offset == 0) && ~s~0!offset == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][#in~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][#in~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~expected~0#1_31 : int, v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22 : int :: (~i~0 == 0 || #memory_int[~s~0!base][8] == 2) && ((((((((1 <= #StackHeapBarrier && ~i~0 == 1) && v_ULTIMATE.start_dll_circular_get_data_at_#res#1_22 == 2) && ~data~0 == 1) && v_ULTIMATE.start_main_~expected~0#1_31 == 2) && ~len~0 == 2) && #res!offset == 0) && ~s~0!offset == 0) || (((((1 <= #StackHeapBarrier && ~i~0 == 0) && ~data~0 == 1) && ~len~0 == 2) && #res!offset == 0) && ~s~0!offset == 0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression * 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: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: 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, 48 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 105.7s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 28.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 1375 SdHoareTripleChecker+Invalid, 27.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 950 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2378 IncrementalHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 425 mSDtfsCounter, 2378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 803 GetRequests, 545 SyntacticMatches, 39 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2273 ImplicationChecksByTransitivity, 37.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=3, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 95 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 27 NumberOfFragments, 1096 HoareAnnotationTreeSize, 11 FomulaSimplifications, 4061 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 4614 FormulaSimplificationTreeSizeReductionInter, 19.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 995 ConstructedInterpolants, 0 QuantifiedInterpolants, 2271 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2957 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 33 InterpolantComputations, 12 PerfectInterpolantSequences, 307/391 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: 8.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 10, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 131, DAG_INTERPRETER_EARLY_EXITS: 10, TOOLS_POST_APPLICATIONS: 327, TOOLS_POST_TIME: 4.7s, TOOLS_POST_CALL_APPLICATIONS: 40, TOOLS_POST_CALL_TIME: 0.9s, TOOLS_POST_RETURN_APPLICATIONS: 30, TOOLS_POST_RETURN_TIME: 1.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 379, TOOLS_QUANTIFIERELIM_TIME: 7.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 606, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 56, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 12, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 40, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 131, DOMAIN_ISBOTTOM_TIME: 0.5s, LOOP_SUMMARIZER_APPLICATIONS: 28, LOOP_SUMMARIZER_CACHE_MISSES: 28, LOOP_SUMMARIZER_OVERALL_TIME: 2.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 40, CALL_SUMMARIZER_APPLICATIONS: 30, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 3286, DAG_COMPRESSION_RETAINED_NODES: 447, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: ((((((index == 0) && (2 == data)) && (data == 1)) && (2 == \old(data))) && (\old(index) == 0)) || ((((((3 == data) && (index == 0)) && (\old(index) == 1)) && (3 == \old(data))) || ((((index == 1) && (3 == data)) && (\old(index) == 1)) && (3 == \old(data)))) && (data == 1))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: ((((1 <= i) && (data == 1)) && (len == 2)) || (((i == 0) && (data == 1)) && (len == 2))) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: ((data == 1) && (len == 2)) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((((((\old(data) == 1) && (\old(len) == 2)) && (len == 1)) && (data == 1)) && (len == 2)) && (data == 1)) || ((((((\old(data) == 1) && (\old(len) == 2)) && (2 == len)) && (data == 1)) && (len == 2)) && (data == 1))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((\old(index) == (index + 1)) || (\old(index) == index)) RESULT: Ultimate proved your program to be correct! [2023-12-02 14:30:10,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_176f7f5b-0038-4ae7-a060-001b4ed180c4/bin/utaipan-verify-nQ1chXbOIh/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