./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.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_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/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_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/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_0414b09c-f882-45ae-a316-d360f14ccaea/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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:08:18,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:08:18,776 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 14:08:18,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:08:18,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:08:18,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:08:18,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:08:18,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:08:18,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:08:18,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:08:18,808 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:08:18,809 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:08:18,809 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:08:18,810 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:08:18,810 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:08:18,811 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:08:18,811 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:08:18,812 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:08:18,812 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:08:18,813 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:08:18,813 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:08:18,814 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:08:18,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:08:18,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 14:08:18,816 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:08:18,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:08:18,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:08:18,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:08:18,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 14:08:18,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:08:18,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 14:08:18,819 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 14:08:18,819 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:08:18,819 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:08:18,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 14:08:18,820 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:08:18,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:08:18,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:08:18,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:08:18,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:08:18,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:08:18,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:08:18,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 14:08:18,821 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:08:18,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:08:18,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:08:18,822 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 14:08:18,822 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:08:18,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:08:18,822 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_0414b09c-f882-45ae-a316-d360f14ccaea/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_0414b09c-f882-45ae-a316-d360f14ccaea/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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2023-12-02 14:08:19,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:08:19,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:08:19,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:08:19,086 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:08:19,086 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:08:19,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-12-02 14:08:21,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:08:22,100 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:08:22,101 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-12-02 14:08:22,115 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/data/e3d4f4a1b/5c09882d0d8f423a9518b50f2e3aaa94/FLAG640dc6f14 [2023-12-02 14:08:22,130 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/data/e3d4f4a1b/5c09882d0d8f423a9518b50f2e3aaa94 [2023-12-02 14:08:22,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:08:22,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:08:22,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:08:22,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:08:22,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:08:22,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148c5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22, skipping insertion in model container [2023-12-02 14:08:22,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,186 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:08:22,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:08:22,455 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:08:22,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:08:22,517 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:08:22,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22 WrapperNode [2023-12-02 14:08:22,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:08:22,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:08:22,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:08:22,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:08:22,524 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:08:22" (1/1) ... [2023-12-02 14:08:22,537 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:08:22" (1/1) ... [2023-12-02 14:08:22,561 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2023-12-02 14:08:22,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:08:22,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:08:22,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:08:22,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:08:22,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:08:22,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:08:22,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:08:22,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:08:22,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (1/1) ... [2023-12-02 14:08:22,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:08:22,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:22,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/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:08:22,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/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:08:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 14:08:22,659 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 14:08:22,660 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 14:08:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 14:08:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:08:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 14:08:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 14:08:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 14:08:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:08:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 14:08:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 14:08:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:08:22,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:08:22,766 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:08:22,768 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:08:22,938 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:08:23,034 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:08:23,035 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 14:08:23,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:23 BoogieIcfgContainer [2023-12-02 14:08:23,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:08:23,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:08:23,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:08:23,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:08:23,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:08:22" (1/3) ... [2023-12-02 14:08:23,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539c659c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:23, skipping insertion in model container [2023-12-02 14:08:23,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:08:22" (2/3) ... [2023-12-02 14:08:23,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539c659c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:23, skipping insertion in model container [2023-12-02 14:08:23,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:23" (3/3) ... [2023-12-02 14:08:23,046 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2023-12-02 14:08:23,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:08:23,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-02 14:08:23,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:08:23,111 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;@5d503cb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:08:23,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 14:08:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 16 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:08:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 14:08:23,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:23,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:23,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-12-02 14:08:23,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:23,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1251499724, now seen corresponding path program 1 times [2023-12-02 14:08:23,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:23,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977230411] [2023-12-02 14:08:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:23,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:23,517 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:08:23,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977230411] [2023-12-02 14:08:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977230411] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:23,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:08:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959155575] [2023-12-02 14:08:23,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:23,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:08:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:08:23,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:08:23,558 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 16 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) 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:08:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:23,625 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2023-12-02 14:08:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:08:23,628 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:08:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:23,635 INFO L225 Difference]: With dead ends: 33 [2023-12-02 14:08:23,636 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 14:08:23,638 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:08:23,641 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:23,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:08:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 14:08:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2023-12-02 14:08:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 15 states have internal predecessors, (17), 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:08:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-12-02 14:08:23,680 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2023-12-02 14:08:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:23,680 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-12-02 14:08:23,681 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:08:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-12-02 14:08:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 14:08:23,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:23,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:23,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 14:08:23,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-12-02 14:08:23,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1239662992, now seen corresponding path program 1 times [2023-12-02 14:08:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:23,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793314387] [2023-12-02 14:08:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:23,831 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:08:23,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793314387] [2023-12-02 14:08:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793314387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:23,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:08:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283788733] [2023-12-02 14:08:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:23,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:08:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:08:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:08:23,835 INFO L87 Difference]: Start difference. First operand 19 states and 21 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:08:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:23,957 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-12-02 14:08:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:08:23,958 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:08:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:23,959 INFO L225 Difference]: With dead ends: 25 [2023-12-02 14:08:23,959 INFO L226 Difference]: Without dead ends: 23 [2023-12-02 14:08:23,959 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:08:23,961 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:23,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-02 14:08:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-02 14:08:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 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:08:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-02 14:08:23,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2023-12-02 14:08:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:23,968 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-02 14:08:23,968 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:08:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-02 14:08:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 14:08:23,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:23,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:23,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 14:08:23,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-12-02 14:08:23,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:23,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1206714368, now seen corresponding path program 1 times [2023-12-02 14:08:23,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:23,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976070898] [2023-12-02 14:08:23,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:23,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:24,148 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:08:24,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:24,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976070898] [2023-12-02 14:08:24,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976070898] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:24,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:08:24,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:08:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589968342] [2023-12-02 14:08:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:24,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:08:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:08:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:08:24,151 INFO L87 Difference]: Start difference. First operand 23 states and 26 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:08:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:24,263 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-12-02 14:08:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:08:24,263 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:08:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:24,264 INFO L225 Difference]: With dead ends: 28 [2023-12-02 14:08:24,264 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 14:08:24,265 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:08:24,267 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:24,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 14:08:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-02 14:08:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 21 states have internal predecessors, (23), 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:08:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-02 14:08:24,274 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2023-12-02 14:08:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:24,274 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-02 14:08:24,275 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:08:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-02 14:08:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 14:08:24,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:24,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:24,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 14:08:24,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-12-02 14:08:24,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash -351385322, now seen corresponding path program 1 times [2023-12-02 14:08:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:24,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745217306] [2023-12-02 14:08:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:24,458 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:08:24,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:24,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745217306] [2023-12-02 14:08:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745217306] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:24,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306356394] [2023-12-02 14:08:24,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:24,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:24,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:24,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:24,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 14:08:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:24,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:08:24,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:24,723 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:08:24,724 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:24,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306356394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:24,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:24,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 14:08:24,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669775487] [2023-12-02 14:08:24,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:24,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:08:24,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:24,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:08:24,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:08:24,727 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:08:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:24,894 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-12-02 14:08:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:08:24,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:08:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:24,896 INFO L225 Difference]: With dead ends: 26 [2023-12-02 14:08:24,896 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 14:08:24,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:08:24,898 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:24,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 14:08:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-02 14:08:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:08:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-02 14:08:24,904 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2023-12-02 14:08:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:24,904 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-02 14:08:24,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:08:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-02 14:08:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 14:08:24,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:24,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:24,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:08:25,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:25,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-12-02 14:08:25,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1237637724, now seen corresponding path program 1 times [2023-12-02 14:08:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415760210] [2023-12-02 14:08:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:25,264 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:08:25,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:25,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415760210] [2023-12-02 14:08:25,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415760210] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:25,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971406132] [2023-12-02 14:08:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:25,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:25,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:25,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 14:08:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:25,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:08:25,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:25,493 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:08:25,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:08:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971406132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:25,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:08:25,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 14:08:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982182087] [2023-12-02 14:08:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:25,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:08:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:25,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:08:25,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:08:25,496 INFO L87 Difference]: Start difference. First operand 25 states and 28 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:08:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:25,562 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-12-02 14:08:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:08:25,564 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:08:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:25,564 INFO L225 Difference]: With dead ends: 36 [2023-12-02 14:08:25,564 INFO L226 Difference]: Without dead ends: 19 [2023-12-02 14:08:25,565 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:08:25,566 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:25,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:08:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-02 14:08:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-02 14:08:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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:08:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-12-02 14:08:25,571 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2023-12-02 14:08:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:25,572 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-12-02 14:08:25,572 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:08:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-12-02 14:08:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 14:08:25,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:08:25,573 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:08:25,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 14:08:25,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:25,780 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-12-02 14:08:25,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:08:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1991956989, now seen corresponding path program 1 times [2023-12-02 14:08:25,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:08:25,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972672391] [2023-12-02 14:08:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:25,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:08:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:25,932 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:08:25,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:08:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972672391] [2023-12-02 14:08:25,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972672391] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:08:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191252753] [2023-12-02 14:08:25,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:08:25,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:08:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:08:25,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:08:25,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 14:08:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:08:26,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:08:26,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:08:26,176 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:08:26,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:08:26,227 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:08:26,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191252753] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:08:26,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1930539771] [2023-12-02 14:08:26,245 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-12-02 14:08:26,245 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:08:26,248 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:08:26,252 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:08:26,252 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:08:32,384 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2023-12-02 14:08:32,537 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:08:36,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1930539771] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:08:36,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:08:36,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 22 [2023-12-02 14:08:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386010578] [2023-12-02 14:08:36,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:08:36,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 14:08:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:08:36,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 14:08:36,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-12-02 14:08:36,980 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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:08:40,553 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:08:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:08:40,903 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2023-12-02 14:08:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 14:08:40,903 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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 21 [2023-12-02 14:08:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:08:40,904 INFO L225 Difference]: With dead ends: 19 [2023-12-02 14:08:40,904 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 14:08:40,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-12-02 14:08:40,905 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:08:40,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 14:08:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 14:08:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 14:08:40,906 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:08:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 14:08:40,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2023-12-02 14:08:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:08:40,907 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 14:08:40,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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:08:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 14:08:40,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 14:08:40,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-12-02 14:08:40,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-12-02 14:08:40,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-12-02 14:08:40,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-12-02 14:08:40,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 14:08:41,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 14:08:41,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 14:09:42,360 WARN L293 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 194 DAG size of output: 191 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 14:09:43,278 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2023-12-02 14:09:43,278 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) (exists ((|v_#memory_int_44| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_155| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_45| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse0 (select |v_#memory_int_44| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |#memory_int| (store |v_#memory_int_44| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 8 1))) (= (store |v_#memory_int_155| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_155| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse1 0))) |v_#memory_int_45|) (= (store |v_#memory_int_45| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 4 (select .cse0 4))) |v_#memory_int_44|)))) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_73| |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))))) (exists ((|v_#valid_49| (Array Int Int))) (and (= (select |v_#valid_49| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (store |v_#valid_49| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (exists ((|v_#valid_48| (Array Int Int))) (and (= (select |v_#valid_48| |ULTIMATE.start_main_~#s~0#1.base|) 0) (= (select |v_#valid_48| 0) 0) (= (select |v_#valid_48| 2) 1) (= (select |v_#valid_48| 1) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#memory_int)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_old(#memory_int)_AFTER_CALL_8| 1))) (and (= (select .cse2 0) 48) (= (select .cse2 1) 0)))) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_73| |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))))) (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_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 12))) (= |ULTIMATE.start_dll_circular_create_~data#1| 1)) [2023-12-02 14:09:43,278 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-12-02 14:09:43,279 INFO L899 garLoopResultBuilder]: For program point L618-3(line 618) no Hoare annotation was computed. [2023-12-02 14:09:43,279 INFO L899 garLoopResultBuilder]: For program point L618-4(line 618) no Hoare annotation was computed. [2023-12-02 14:09:43,279 INFO L895 garLoopResultBuilder]: At program point L618-5(lines 618 620) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse5 (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5))) [2023-12-02 14:09:43,279 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2023-12-02 14:09:43,279 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) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#length_20| (Array Int Int))) (and (= (store |v_#length_20| |ULTIMATE.start_main_~#s~0#1.base| 4) |#length|) (= 2 (select |v_#length_20| 1)) (= (select |v_#length_20| 2) 27))) (exists ((|v_#valid_48| (Array Int Int))) (and (= (select |v_#valid_48| |ULTIMATE.start_main_~#s~0#1.base|) 0) (= (store |v_#valid_48| |ULTIMATE.start_main_~#s~0#1.base| 1) |#valid|) (= (select |v_#valid_48| 0) 0) (= (select |v_#valid_48| 2) 1) (= (select |v_#valid_48| 1) 1))) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))) [2023-12-02 14:09:43,279 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-02 14:09:43,280 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2023-12-02 14:09:43,280 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 14:09:43,280 INFO L899 garLoopResultBuilder]: For program point L595(line 595) no Hoare annotation was computed. [2023-12-02 14:09:43,280 INFO L899 garLoopResultBuilder]: For program point L595-1(line 595) no Hoare annotation was computed. [2023-12-02 14:09:43,280 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 14:09:43,280 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 618) no Hoare annotation was computed. [2023-12-02 14:09:43,281 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_~#s~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse8 (= |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 (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) .cse8) (and .cse0 .cse1 .cse2 (exists ((|v_#memory_int_44| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_155| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_int_45| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse9 (select |v_#memory_int_44| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |#memory_int| (store |v_#memory_int_44| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse9 8 1))) (= (store |v_#memory_int_155| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_155| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse10 0))) |v_#memory_int_45|) (= (store |v_#memory_int_45| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse10 4 (select .cse9 4))) |v_#memory_int_44|)))) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_73| |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))))) (exists ((|v_#valid_49| (Array Int Int))) (and (= (select |v_#valid_49| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (store |v_#valid_49| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#valid|))) .cse3 (exists ((|v_#valid_48| (Array Int Int))) (and (= (select |v_#valid_48| |ULTIMATE.start_main_~#s~0#1.base|) 0) (= (select |v_#valid_48| 0) 0) (= (select |v_#valid_48| 2) 1) (= (select |v_#valid_48| 1) 1))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse4 (exists ((|v_old(#memory_int)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_old(#memory_int)_AFTER_CALL_8| 1))) (and (= (select .cse11 0) 48) (= (select .cse11 1) 0)))) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_73| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_73| |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))))) (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_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 12))) .cse8))) [2023-12-02 14:09:43,281 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-12-02 14:09:43,281 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-02 14:09:43,282 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (let ((.cse36 (select |old(#memory_int)| 1))) (let ((.cse0 (= |old(#length)| |#length|)) (.cse16 (= |#memory_int| |old(#memory_int)|)) (.cse17 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse18 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse20 (= (select .cse36 0) 48)) (.cse15 (+ |#StackHeapBarrier| 1)) (.cse21 (= (select .cse36 1) 0)) (.cse19 (= |old(#valid)| |#valid|))) (or (and .cse0 (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (<= .cse15 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_5|)) (.cse3 (exists ((|v_#length_21| (Array Int Int))) (= |old(#length)| (store |v_#length_21| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 12)))) (.cse4 (exists ((|v_#length_20| (Array Int Int))) (and (= 2 (select |v_#length_20| 1)) (= (select |v_#length_20| 2) 27)))) (.cse5 (exists ((|v_#valid_49| (Array Int Int))) (and (= |old(#valid)| (store |v_#valid_49| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 1)) (= (select |v_#valid_49| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 0)))) (.cse6 (not (= |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 0))) (.cse7 (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store (store (store (select |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 0 0) 4 0) 8 (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 8)))))) (.cse8 (<= (+ |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 1) |#StackHeapBarrier|)) (.cse9 (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store (store (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 0 0) 4 0) 8 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 8))) |old(#memory_$Pointer$.base)|))) (.cse10 (exists ((|v_#valid_48| (Array Int Int))) (and (= (select |v_#valid_48| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_5|) 0) (= (select |v_#valid_48| 0) 0) (= (select |v_#valid_48| 2) 1) (= (select |v_#valid_48| 1) 1)))) (.cse11 (exists ((|v_#memory_int_44| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_155| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_#memory_int_45| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|)) (.cse14 (select |v_#memory_int_44| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|))) (and (= |v_#memory_int_44| (store |v_#memory_int_45| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store .cse13 4 (select .cse14 4)))) (= |v_#memory_int_45| (store |v_#memory_int_155| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store (select |v_#memory_int_155| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 0 (select .cse13 0)))) (= |old(#memory_int)| (store |v_#memory_int_44| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store .cse14 8 1)))))))) (or (and (exists ((|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_old(#memory_int)_AFTER_CALL_9| 1))) (and (= (select .cse1 0) 48) (= (select .cse1 1) 0)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_old(#memory_int)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_old(#memory_int)_AFTER_CALL_8| 1))) (and (= (select .cse12 0) 48) (= (select .cse12 1) 0)))) .cse8 .cse9 .cse10 .cse11)))) .cse16 .cse17 .cse18 .cse19) (and (or (forall ((|v_#length_20| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_48| (Array Int Int))) (or (not (= (select |v_#valid_48| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) 0)) (not (= (select |v_#valid_48| 1) 1)) (not (= |old(#length)| (store |v_#length_20| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| 4))) (not (= (select |v_#valid_48| 0) 0)) (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| .cse15) (not (= (select |v_#length_20| 2) 27)) (not (= 2 (select |v_#length_20| 1))) (not (= |old(#valid)| (store |v_#valid_48| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| 1))) (not (= (select |v_#valid_48| 2) 1)))) (not .cse20) (not .cse21)) (forall ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_5| Int)) (let ((.cse22 (forall ((|v_#memory_int_44| (Array Int (Array Int Int))) (|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_155| (Array Int (Array Int Int)))) (let ((.cse35 (select |v_#memory_int_45| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|)) (.cse34 (select |v_#memory_int_44| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|))) (or (not (= |old(#memory_int)| (store |v_#memory_int_44| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store .cse34 8 1)))) (not (= |v_#memory_int_45| (store |v_#memory_int_155| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store (select |v_#memory_int_155| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 0 (select .cse35 0))))) (not (= |v_#memory_int_44| (store |v_#memory_int_45| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store .cse35 4 (select .cse34 4))))))))) (.cse23 (forall ((|v_#valid_49| (Array Int Int))) (or (not (= |old(#valid)| (store |v_#valid_49| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 1))) (not (= (select |v_#valid_49| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 0))))) (.cse24 (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_5| .cse15)) (.cse25 (forall ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (not (= (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store (store (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 0 0) 4 0) 8 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 8))) |old(#memory_$Pointer$.base)|)))) (.cse27 (forall ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (not (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| (store (store (store (select |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 0 0) 4 0) 8 (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3|) 8))))))) (.cse28 (< |#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 1))) (.cse29 (forall ((|v_#valid_48| (Array Int Int))) (or (not (= (select |v_#valid_48| 1) 1)) (not (= (select |v_#valid_48| 0) 0)) (not (= (select |v_#valid_48| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_5|) 0)) (not (= (select |v_#valid_48| 2) 1))))) (.cse30 (forall ((|v_#length_20| (Array Int Int))) (or (not (= (select |v_#length_20| 2) 27)) (not (= 2 (select |v_#length_20| 1)))))) (.cse31 (= |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 0)) (.cse32 (forall ((|v_#length_21| (Array Int Int))) (not (= |old(#length)| (store |v_#length_21| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_3| 12)))))) (and (or .cse22 .cse23 .cse24 .cse25 (forall ((|v_old(#memory_int)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_old(#memory_int)_AFTER_CALL_8| 1))) (or (not (= (select .cse26 0) 48)) (not (= (select .cse26 1) 0))))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (or (forall ((|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse33 (select |v_old(#memory_int)_AFTER_CALL_9| 1))) (or (not (= (select .cse33 0) 48)) (not (= (select .cse33 1) 0))))) .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32))))) (not (= |node_create_#in~data#1| 1)) (< |#StackHeapBarrier| 1) (and .cse0 .cse16 .cse17 .cse18 .cse20 (exists ((|v_#length_20| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_48| (Array Int Int))) (and (= |old(#length)| (store |v_#length_20| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| 4)) (= (select |v_#valid_48| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) 0) (<= .cse15 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) (= (select |v_#valid_48| 0) 0) (= 2 (select |v_#length_20| 1)) (= (select |v_#length_20| 2) 27) (= (select |v_#valid_48| 2) 1) (= (select |v_#valid_48| 1) 1) (= |old(#valid)| (store |v_#valid_48| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| 1)))) .cse21 .cse19)))) [2023-12-02 14:09:43,282 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-12-02 14:09:43,285 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-02 14:09:43,287 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 14:09:43,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:09:43,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:09:43,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 14:09:43,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_44 : [int,int]int, v_#memory_int_45 : [int,int]int, v_#memory_int_155 : [int,int]int :: (#memory_int == v_#memory_int_44[~head~0!base := v_#memory_int_44[~head~0!base][8 := 1]] && v_#memory_int_155[~head~0!base := v_#memory_int_155[~head~0!base][0 := v_#memory_int_45[~head~0!base][0]]] == v_#memory_int_45) && v_#memory_int_45[~head~0!base := v_#memory_int_45[~head~0!base][4 := v_#memory_int_44[~head~0!base][4]]] == v_#memory_int_44) could not be translated [2023-12-02 14:09:43,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_73 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_73[~head~0!base := v_#memory_$Pointer$.offset_73[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated [2023-12-02 14:09:43,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_49 : [int]int :: v_#valid_49[~head~0!base] == 0 && v_#valid_49[~head~0!base := 1] == #valid) could not be translated [2023-12-02 14:09:43,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_48 : [int]int :: ((v_#valid_48[~#s~0!base] == 0 && v_#valid_48[0] == 0) && v_#valid_48[2] == 1) && v_#valid_48[1] == 1) could not be translated [2023-12-02 14:09:43,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-12-02 14:09:43,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_old(#memory_int)_AFTER_CALL_8 : [int,int]int :: v_old_#memory_int__AFTER_CALL_8[1][0] == 48 && v_old_#memory_int__AFTER_CALL_8[1][1] == 0) could not be translated [2023-12-02 14:09:43,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_73 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_73[~head~0!base := v_#memory_$Pointer$.base_73[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]]) could not be translated [2023-12-02 14:09:43,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_21 : [int]int :: #length == v_#length_21[~head~0!base := 12]) could not be translated [2023-12-02 14:09:43,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:09:43 BoogieIcfgContainer [2023-12-02 14:09:43,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 14:09:43,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 14:09:43,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 14:09:43,310 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 14:09:43,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:23" (3/4) ... [2023-12-02 14:09:43,312 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 14:09:43,315 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-12-02 14:09:43,320 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-12-02 14:09:43,321 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-12-02 14:09:43,321 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 14:09:43,322 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 14:09:43,349 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:09:43,367 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:09:43,414 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 14:09:43,414 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 14:09:43,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 14:09:43,415 INFO L158 Benchmark]: Toolchain (without parser) took 81280.93ms. Allocated memory was 142.6MB in the beginning and 270.5MB in the end (delta: 127.9MB). Free memory was 101.8MB in the beginning and 196.3MB in the end (delta: -94.6MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2023-12-02 14:09:43,415 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 117.2MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:09:43,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.37ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 84.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 14:09:43,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.07ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 81.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:09:43,416 INFO L158 Benchmark]: Boogie Preprocessor took 31.03ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 80.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:09:43,417 INFO L158 Benchmark]: RCFGBuilder took 442.81ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 56.7MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 14:09:43,417 INFO L158 Benchmark]: TraceAbstraction took 80269.52ms. Allocated memory was 142.6MB in the beginning and 270.5MB in the end (delta: 127.9MB). Free memory was 56.1MB in the beginning and 201.6MB in the end (delta: -145.5MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. [2023-12-02 14:09:43,417 INFO L158 Benchmark]: Witness Printer took 104.81ms. Allocated memory is still 270.5MB. Free memory was 201.6MB in the beginning and 196.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 14:09:43,419 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.20ms. Allocated memory is still 142.6MB. Free memory was 117.2MB in the beginning and 117.2MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.37ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 84.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.07ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 81.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.03ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 80.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.81ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 56.7MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 80269.52ms. Allocated memory was 142.6MB in the beginning and 270.5MB in the end (delta: 127.9MB). Free memory was 56.1MB in the beginning and 201.6MB in the end (delta: -145.5MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. * Witness Printer took 104.81ms. Allocated memory is still 270.5MB. Free memory was 201.6MB in the beginning and 196.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_44 : [int,int]int, v_#memory_int_45 : [int,int]int, v_#memory_int_155 : [int,int]int :: (#memory_int == v_#memory_int_44[~head~0!base := v_#memory_int_44[~head~0!base][8 := 1]] && v_#memory_int_155[~head~0!base := v_#memory_int_155[~head~0!base][0 := v_#memory_int_45[~head~0!base][0]]] == v_#memory_int_45) && v_#memory_int_45[~head~0!base := v_#memory_int_45[~head~0!base][4 := v_#memory_int_44[~head~0!base][4]]] == v_#memory_int_44) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_73 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_73[~head~0!base := v_#memory_$Pointer$.offset_73[~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_#valid_49 : [int]int :: v_#valid_49[~head~0!base] == 0 && v_#valid_49[~head~0!base := 1] == #valid) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_48 : [int]int :: ((v_#valid_48[~#s~0!base] == 0 && v_#valid_48[0] == 0) && v_#valid_48[2] == 1) && v_#valid_48[1] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_old(#memory_int)_AFTER_CALL_8 : [int,int]int :: v_old_#memory_int__AFTER_CALL_8[1][0] == 48 && v_old_#memory_int__AFTER_CALL_8[1][1] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_73 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_73[~head~0!base := v_#memory_$Pointer$.base_73[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_21 : [int]int :: #length == v_#length_21[~head~0!base := 12]) could not be translated * 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: 618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 618]: 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, 20 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 80.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 62.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 63 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 12 NumberOfFragments, 1459 HoareAnnotationTreeSize, 7 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 380 FormulaSimplificationTreeSizeReductionInter, 62.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 7 NumberOfNonLiveVariables, 942 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 54/66 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: 6.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 16, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 25, TOOLS_POST_TIME: 1.1s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 39, TOOLS_QUANTIFIERELIM_TIME: 2.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 59, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 8, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 3.9s, DOMAIN_ISBOTTOM_APPLICATIONS: 16, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 4.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 289, DAG_COMPRESSION_RETAINED_NODES: 58, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((1 <= i) && (i <= 2)) && (data == 1)) && (len == 2)) || (((i == 0) && (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))) RESULT: Ultimate proved your program to be correct! [2023-12-02 14:09:43,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0414b09c-f882-45ae-a316-d360f14ccaea/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