./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:45:29,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:45:29,850 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 23:45:29,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:45:29,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:45:29,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:45:29,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:45:29,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:45:29,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:45:29,881 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:45:29,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:45:29,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:45:29,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:45:29,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:45:29,884 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:45:29,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:45:29,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 23:45:29,886 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:45:29,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:45:29,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:45:29,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:45:29,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 23:45:29,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:45:29,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 23:45:29,889 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:45:29,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:45:29,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:45:29,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:45:29,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:45:29,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:45:29,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:45:29,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:45:29,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:45:29,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:45:29,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 23:45:29,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:45:29,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:45:29,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:45:29,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:45:29,894 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 23:45:29,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:45:29,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:45:29,894 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/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_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2023-11-28 23:45:30,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:45:30,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:45:30,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:45:30,147 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:45:30,149 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:45:30,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2023-11-28 23:45:32,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:45:33,184 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:45:33,184 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2023-11-28 23:45:33,199 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/data/c00bf604f/9ba41a876ce04616b01a9e9376f30d58/FLAG5d4e9a3ae [2023-11-28 23:45:33,212 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/data/c00bf604f/9ba41a876ce04616b01a9e9376f30d58 [2023-11-28 23:45:33,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:45:33,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:45:33,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:45:33,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:45:33,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:45:33,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c344cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33, skipping insertion in model container [2023-11-28 23:45:33,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,262 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:45:33,524 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2023-11-28 23:45:33,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:45:33,539 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:45:33,578 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2023-11-28 23:45:33,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:45:33,610 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:45:33,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33 WrapperNode [2023-11-28 23:45:33,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:45:33,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:45:33,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:45:33,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:45:33,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,650 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2023-11-28 23:45:33,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:45:33,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:45:33,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:45:33,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:45:33,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,684 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 9, 11]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 11 writes are split as follows [0, 2, 9]. [2023-11-28 23:45:33,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:45:33,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:45:33,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:45:33,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:45:33,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (1/1) ... [2023-11-28 23:45:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:45:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:45:33,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:45:33,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:45:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 23:45:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 23:45:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 23:45:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-28 23:45:33,765 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-28 23:45:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 23:45:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:45:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:45:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-28 23:45:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-28 23:45:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-28 23:45:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-28 23:45:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-28 23:45:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-28 23:45:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:45:33,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-28 23:45:33,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-28 23:45:33,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-28 23:45:33,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 23:45:33,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 23:45:33,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 23:45:33,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:45:33,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:45:33,892 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:45:33,894 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:45:34,107 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:45:34,139 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:45:34,140 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-28 23:45:34,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:45:34 BoogieIcfgContainer [2023-11-28 23:45:34,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:45:34,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:45:34,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:45:34,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:45:34,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:45:33" (1/3) ... [2023-11-28 23:45:34,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4be033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:45:34, skipping insertion in model container [2023-11-28 23:45:34,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:33" (2/3) ... [2023-11-28 23:45:34,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4be033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:45:34, skipping insertion in model container [2023-11-28 23:45:34,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:45:34" (3/3) ... [2023-11-28 23:45:34,149 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2023-11-28 23:45:34,165 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:45:34,165 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 23:45:34,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:45:34,211 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=PETRI_NET, 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;@652b6e0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:45:34,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 23:45:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-11-28 23:45:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-28 23:45:34,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:45:34,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:45:34,222 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:45:34,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1122641969, now seen corresponding path program 1 times [2023-11-28 23:45:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:34,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986774146] [2023-11-28 23:45:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:45:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:45:34,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986774146] [2023-11-28 23:45:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986774146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:45:34,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:45:34,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:45:34,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408068477] [2023-11-28 23:45:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:45:34,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:45:34,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:34,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:45:34,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:45:34,522 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-11-28 23:45:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:45:34,577 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-11-28 23:45:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:45:34,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-28 23:45:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:45:34,584 INFO L225 Difference]: With dead ends: 32 [2023-11-28 23:45:34,585 INFO L226 Difference]: Without dead ends: 19 [2023-11-28 23:45:34,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-28 23:45:34,592 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:45:34,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:45:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-28 23:45:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-28 23:45:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-11-28 23:45:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-11-28 23:45:34,622 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2023-11-28 23:45:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:45:34,623 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-28 23:45:34,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-11-28 23:45:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-11-28 23:45:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-28 23:45:34,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:45:34,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:45:34,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:45:34,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:45:34,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1494820932, now seen corresponding path program 1 times [2023-11-28 23:45:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:34,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361042496] [2023-11-28 23:45:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:34,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:45:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:45:34,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:34,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361042496] [2023-11-28 23:45:34,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361042496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:45:34,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:45:34,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:45:34,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862514703] [2023-11-28 23:45:34,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:45:34,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:45:34,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:34,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:45:34,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:45:34,816 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-11-28 23:45:34,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:45:34,876 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-11-28 23:45:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:45:34,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-28 23:45:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:45:34,877 INFO L225 Difference]: With dead ends: 32 [2023-11-28 23:45:34,878 INFO L226 Difference]: Without dead ends: 24 [2023-11-28 23:45:34,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:45:34,880 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:45:34,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:45:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-28 23:45:34,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2023-11-28 23:45:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:45:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-28 23:45:34,887 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-11-28 23:45:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:45:34,887 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-28 23:45:34,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-11-28 23:45:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-28 23:45:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-28 23:45:34,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:45:34,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:45:34,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:45:34,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:45:34,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:34,890 INFO L85 PathProgramCache]: Analyzing trace with hash 597595060, now seen corresponding path program 1 times [2023-11-28 23:45:34,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:34,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396902473] [2023-11-28 23:45:34,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:34,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:35,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:45:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 23:45:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 23:45:35,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:35,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396902473] [2023-11-28 23:45:35,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396902473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:45:35,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:45:35,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:45:35,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96217082] [2023-11-28 23:45:35,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:45:35,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:45:35,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:35,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:45:35,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:45:35,084 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:45:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:45:35,149 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-11-28 23:45:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:45:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-11-28 23:45:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:45:35,150 INFO L225 Difference]: With dead ends: 27 [2023-11-28 23:45:35,150 INFO L226 Difference]: Without dead ends: 23 [2023-11-28 23:45:35,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:45:35,152 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 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-11-28 23:45:35,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:45:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-28 23:45:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-11-28 23:45:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-11-28 23:45:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-28 23:45:35,159 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 20 [2023-11-28 23:45:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:45:35,159 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-28 23:45:35,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:45:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-28 23:45:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-28 23:45:35,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:45:35,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:45:35,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:45:35,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:45:35,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1853951991, now seen corresponding path program 1 times [2023-11-28 23:45:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:35,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643531067] [2023-11-28 23:45:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:35,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:45:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:35,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 23:45:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 23:45:35,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:35,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643531067] [2023-11-28 23:45:35,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643531067] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:45:35,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769054403] [2023-11-28 23:45:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:35,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:45:35,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:45:35,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:45:35,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 23:45:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:35,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:45:35,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:45:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 23:45:35,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:45:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 23:45:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769054403] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:45:35,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:45:35,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-28 23:45:35,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526358108] [2023-11-28 23:45:35,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:45:35,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 23:45:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:35,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 23:45:35,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-28 23:45:35,657 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-28 23:45:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:45:35,734 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-11-28 23:45:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:45:35,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2023-11-28 23:45:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:45:35,735 INFO L225 Difference]: With dead ends: 28 [2023-11-28 23:45:35,735 INFO L226 Difference]: Without dead ends: 24 [2023-11-28 23:45:35,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-28 23:45:35,737 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:45:35,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:45:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-28 23:45:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-28 23:45:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-11-28 23:45:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-11-28 23:45:35,742 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 23 [2023-11-28 23:45:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:45:35,743 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-28 23:45:35,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-28 23:45:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-11-28 23:45:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-28 23:45:35,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:45:35,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:45:35,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 23:45:35,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:45:35,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:45:35,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:35,949 INFO L85 PathProgramCache]: Analyzing trace with hash -656701228, now seen corresponding path program 2 times [2023-11-28 23:45:35,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:35,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418569062] [2023-11-28 23:45:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:35,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:36,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:45:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 23:45:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-28 23:45:36,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:36,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418569062] [2023-11-28 23:45:36,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418569062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:45:36,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:45:36,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:45:36,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198218591] [2023-11-28 23:45:36,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:45:36,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:45:36,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:36,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:45:36,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:45:36,285 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-11-28 23:45:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:45:36,435 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-28 23:45:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:45:36,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-11-28 23:45:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:45:36,437 INFO L225 Difference]: With dead ends: 33 [2023-11-28 23:45:36,438 INFO L226 Difference]: Without dead ends: 29 [2023-11-28 23:45:36,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:45:36,439 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:45:36,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 23:45:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-28 23:45:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-28 23:45:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-11-28 23:45:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-11-28 23:45:36,445 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 26 [2023-11-28 23:45:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:45:36,445 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-28 23:45:36,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-11-28 23:45:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-11-28 23:45:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-28 23:45:36,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:45:36,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:45:36,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:45:36,447 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:45:36,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash -599442926, now seen corresponding path program 1 times [2023-11-28 23:45:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549529103] [2023-11-28 23:45:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:37,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:45:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:37,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 23:45:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-28 23:45:37,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:37,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549529103] [2023-11-28 23:45:37,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549529103] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:45:37,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727090874] [2023-11-28 23:45:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:37,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:45:37,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:45:37,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:45:37,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 23:45:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:37,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-28 23:45:37,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:45:37,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 23:45:37,659 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 23:45:37,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-28 23:45:37,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 23:45:37,766 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:45:37,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-11-28 23:45:37,896 INFO L349 Elim1Store]: treesize reduction 74, result has 12.9 percent of original size [2023-11-28 23:45:37,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 151 [2023-11-28 23:45:37,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 89 [2023-11-28 23:45:38,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 124 [2023-11-28 23:45:38,015 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-28 23:45:38,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 98 [2023-11-28 23:45:38,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-11-28 23:45:38,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:45:38,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2023-11-28 23:45:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-28 23:45:38,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:45:38,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2023-11-28 23:45:38,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-11-28 23:45:38,079 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2023-11-28 23:45:38,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2023-11-28 23:45:38,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:45:38,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-28 23:45:38,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2023-11-28 23:45:38,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-28 23:45:38,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-28 23:45:38,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-28 23:45:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2023-11-28 23:45:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727090874] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:45:38,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:45:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 36 [2023-11-28 23:45:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217695393] [2023-11-28 23:45:38,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:45:38,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-28 23:45:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:38,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-28 23:45:38,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1021, Unknown=11, NotChecked=130, Total=1260 [2023-11-28 23:45:38,624 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 36 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-28 23:45:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:45:39,416 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-28 23:45:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 23:45:39,417 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2023-11-28 23:45:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:45:39,419 INFO L225 Difference]: With dead ends: 42 [2023-11-28 23:45:39,419 INFO L226 Difference]: Without dead ends: 33 [2023-11-28 23:45:39,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=140, Invalid=1339, Unknown=11, NotChecked=150, Total=1640 [2023-11-28 23:45:39,421 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 23:45:39,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 240 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 347 Invalid, 0 Unknown, 61 Unchecked, 0.5s Time] [2023-11-28 23:45:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-28 23:45:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-11-28 23:45:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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-11-28 23:45:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-11-28 23:45:39,429 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2023-11-28 23:45:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:45:39,430 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-11-28 23:45:39,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-28 23:45:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-11-28 23:45:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-28 23:45:39,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:45:39,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:45:39,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 23:45:39,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:45:39,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:45:39,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash 80615444, now seen corresponding path program 1 times [2023-11-28 23:45:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:39,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809164617] [2023-11-28 23:45:39,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:39,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:41,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:45:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:41,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 23:45:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 23:45:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:41,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809164617] [2023-11-28 23:45:41,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809164617] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:45:41,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868707268] [2023-11-28 23:45:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:41,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:45:41,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:45:41,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:45:41,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 23:45:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:41,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-28 23:45:41,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:45:41,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 23:45:42,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-28 23:45:42,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-28 23:45:42,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 23:45:42,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 23:45:42,221 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:45:42,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2023-11-28 23:45:42,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-28 23:45:42,400 INFO L349 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-11-28 23:45:42,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 136 [2023-11-28 23:45:42,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:45:42,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2023-11-28 23:45:42,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2023-11-28 23:45:42,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2023-11-28 23:45:42,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-28 23:45:42,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 174 [2023-11-28 23:45:42,743 INFO L349 Elim1Store]: treesize reduction 84, result has 5.6 percent of original size [2023-11-28 23:45:42,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 182 treesize of output 159 [2023-11-28 23:45:42,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 122 [2023-11-28 23:45:42,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2023-11-28 23:45:42,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 42 [2023-11-28 23:45:42,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-28 23:45:42,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2023-11-28 23:45:43,169 INFO L349 Elim1Store]: treesize reduction 271, result has 12.3 percent of original size [2023-11-28 23:45:43,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 1925 treesize of output 1758 [2023-11-28 23:45:43,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:45:43,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:45:43,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:45:43,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:45:43,350 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:45:43,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:45:43,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:45:43,352 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:45:43,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 52 [2023-11-28 23:45:43,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2023-11-28 23:45:44,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-11-28 23:45:44,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2023-11-28 23:45:44,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-11-28 23:45:44,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2023-11-28 23:45:44,897 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:45:44,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:45:44,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-28 23:45:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:45:44,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:45:45,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 820 treesize of output 724 [2023-11-28 23:45:45,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 544 treesize of output 448 [2023-11-28 23:45:45,231 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_889 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_885))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (select (let ((.cse1 (store .cse5 .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1))) (store .cse2 .cse0 (store (select .cse2 .cse0) (+ .cse3 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse0))) .cse0) .cse3))))))) (forall ((v_ArrVal_894 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (let ((.cse7 (store .cse12 .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse7) .cse8 v_ArrVal_893) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse9 (store .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) (+ .cse10 4) v_ArrVal_894))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse10))) .cse8)) .cse10) .cse10))))))) is different from false [2023-11-28 23:45:45,586 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_894 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (let ((.cse1 (store .cse5 .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_893) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse3 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ .cse0 4) v_ArrVal_894))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse0))) .cse2)) .cse0)))))) (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_889 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_885))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (let ((.cse10 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (let ((.cse7 (store .cse12 .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse7) .cse8 v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse9 (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse7))) (store .cse9 .cse8 (store (select .cse9 .cse8) (+ .cse10 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse8))) .cse8) .cse10)) .cse8))))))) is different from false [2023-11-28 23:45:45,610 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_894 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_882))) (let ((.cse5 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (let ((.cse2 (store .cse6 .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2) .cse3 v_ArrVal_893) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse4 (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ .cse0 4) v_ArrVal_894))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse0))) .cse3)) .cse0))))))) (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_889 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_883))) (let ((.cse13 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_885))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse8 (select .cse14 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse8 (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_882) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (select (let ((.cse10 (store .cse14 .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse10) .cse8 v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (let ((.cse11 (store .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse10))) (store .cse11 .cse8 (store (select .cse11 .cse8) (+ .cse12 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse8))) .cse8) .cse12)))))))))) is different from false [2023-11-28 23:45:45,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:45:45,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 252 [2023-11-28 23:45:45,669 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2023-11-28 23:45:45,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 17049 treesize of output 11963 [2023-11-28 23:45:45,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:45:45,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2309 treesize of output 2293 [2023-11-28 23:45:45,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2782 treesize of output 2634 [2023-11-28 23:45:45,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:45:45,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1239 treesize of output 1181 [2023-11-28 23:45:45,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 874 treesize of output 850 [2023-11-28 23:45:45,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:45:45,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1137 treesize of output 1077 [2023-11-28 23:45:45,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 804 treesize of output 754 [2023-11-28 23:45:46,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:45:46,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 113 [2023-11-28 23:45:47,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:45:47,855 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:45:47,870 INFO L349 Elim1Store]: treesize reduction 131, result has 0.8 percent of original size [2023-11-28 23:45:47,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 4073 treesize of output 1 [2023-11-28 23:45:48,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868707268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:45:48,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:45:48,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2023-11-28 23:45:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584237695] [2023-11-28 23:45:48,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:45:48,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-28 23:45:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:48,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-28 23:45:48,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=963, Unknown=3, NotChecked=192, Total=1260 [2023-11-28 23:45:48,019 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 29 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 23 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-28 23:45:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:45:48,786 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2023-11-28 23:45:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-28 23:45:48,787 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 23 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-11-28 23:45:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:45:48,788 INFO L225 Difference]: With dead ends: 45 [2023-11-28 23:45:48,788 INFO L226 Difference]: Without dead ends: 36 [2023-11-28 23:45:48,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=136, Invalid=1278, Unknown=4, NotChecked=222, Total=1640 [2023-11-28 23:45:48,790 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 23:45:48,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 182 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 23:45:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-28 23:45:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-11-28 23:45:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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-11-28 23:45:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-11-28 23:45:48,798 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 26 [2023-11-28 23:45:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:45:48,798 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-11-28 23:45:48,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 23 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-28 23:45:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-11-28 23:45:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-28 23:45:48,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:45:48,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:45:48,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-28 23:45:49,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-28 23:45:49,000 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:45:49,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:49,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1644135123, now seen corresponding path program 2 times [2023-11-28 23:45:49,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:49,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503696777] [2023-11-28 23:45:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:49,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:45:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 23:45:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 23:45:49,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:49,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503696777] [2023-11-28 23:45:49,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503696777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:45:49,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689731349] [2023-11-28 23:45:49,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:45:49,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:45:49,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:45:49,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:45:49,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-28 23:45:49,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:45:49,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:45:49,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:45:49,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:45:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 23:45:49,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:45:49,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689731349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:45:49,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:45:49,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2023-11-28 23:45:49,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703020031] [2023-11-28 23:45:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:45:49,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:45:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:45:49,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-28 23:45:49,548 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-11-28 23:45:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:45:49,585 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-28 23:45:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:45:49,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 29 [2023-11-28 23:45:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:45:49,586 INFO L225 Difference]: With dead ends: 46 [2023-11-28 23:45:49,586 INFO L226 Difference]: Without dead ends: 29 [2023-11-28 23:45:49,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-28 23:45:49,587 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:45:49,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:45:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-28 23:45:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-28 23:45:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-11-28 23:45:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-28 23:45:49,593 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 29 [2023-11-28 23:45:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:45:49,594 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-28 23:45:49,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-11-28 23:45:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-28 23:45:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-28 23:45:49,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:45:49,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:45:49,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-28 23:45:49,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:45:49,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:45:49,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1612143606, now seen corresponding path program 3 times [2023-11-28 23:45:49,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:49,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259422170] [2023-11-28 23:45:49,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:49,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:49,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 23:45:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 23:45:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-28 23:45:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-28 23:45:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:49,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259422170] [2023-11-28 23:45:49,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259422170] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:45:49,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879018682] [2023-11-28 23:45:49,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 23:45:49,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:45:49,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:45:49,968 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:45:49,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-28 23:45:50,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-28 23:45:50,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:45:50,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:45:50,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:45:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-28 23:45:50,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:45:50,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879018682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:45:50,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:45:50,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-28 23:45:50,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438680347] [2023-11-28 23:45:50,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:45:50,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:45:50,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:50,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:45:50,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:45:50,324 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-28 23:45:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:45:50,343 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-11-28 23:45:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:45:50,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 34 [2023-11-28 23:45:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:45:50,344 INFO L225 Difference]: With dead ends: 32 [2023-11-28 23:45:50,344 INFO L226 Difference]: Without dead ends: 0 [2023-11-28 23:45:50,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:45:50,345 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:45:50,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:45:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-28 23:45:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-28 23:45:50,346 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-11-28 23:45:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-28 23:45:50,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2023-11-28 23:45:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:45:50,347 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-28 23:45:50,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-28 23:45:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-28 23:45:50,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-28 23:45:50,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 23:45:50,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-28 23:45:50,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-28 23:45:50,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-28 23:45:50,817 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 613) no Hoare annotation was computed. [2023-11-28 23:45:50,817 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |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) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) [2023-11-28 23:45:50,817 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-11-28 23:45:50,817 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 614 629) no Hoare annotation was computed. [2023-11-28 23:45:50,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 627) no Hoare annotation was computed. [2023-11-28 23:45:50,818 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 625) no Hoare annotation was computed. [2023-11-28 23:45:50,818 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-11-28 23:45:50,818 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-28 23:45:50,819 INFO L895 garLoopResultBuilder]: At program point L619-2(lines 619 622) the Hoare annotation is: (let ((.cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (.cse2 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (or (and .cse0 (= .cse1 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_arrayElimCell_27 Int)) (let ((.cse8 (store (store |#memory_$Pointer$#2.base| v_DerPreprocessor_5 v_DerPreprocessor_7) v_DerPreprocessor_6 v_DerPreprocessor_8))) (let ((.cse9 (select .cse8 v_arrayElimCell_27))) (let ((.cse5 (select .cse9 4))) (let ((.cse7 (select |#memory_$Pointer$#2.offset| v_arrayElimCell_27)) (.cse4 (select .cse9 0)) (.cse6 (select .cse8 .cse5))) (and (= .cse1 .cse4) (= .cse5 v_DerPreprocessor_5) (= (select |#memory_$Pointer$#2.base| .cse5) (store .cse6 0 .cse4)) (= (select .cse7 0) 0) (= (select .cse7 4) 0) (= (select (select .cse8 .cse4) 4) .cse5) (= v_DerPreprocessor_6 .cse4) (= (select (select |#memory_$Pointer$#2.offset| .cse5) 0) 0) (not (= v_arrayElimCell_27 .cse4)) (= .cse5 .cse4) (= .cse6 v_DerPreprocessor_7))))))) .cse2 .cse3) (let ((.cse16 (select |#memory_$Pointer$#2.base| .cse1))) (let ((.cse11 (select .cse16 0))) (let ((.cse13 (select .cse16 4)) (.cse12 (select |#memory_$Pointer$#2.offset| .cse1)) (.cse10 (select |#memory_$Pointer$#2.base| .cse11))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select .cse10 0) .cse11)) (= (select .cse12 0) 0) (= .cse13 .cse11) (= (select (select |#memory_$Pointer$#2.offset| .cse11) 0) 0) .cse2 (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse14 (select |#memory_$Pointer$#2.base| .cse13))) (= (select (store (store |#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) .cse1 (store .cse14 4 .cse13)) .cse13) .cse14))) .cse3 (= (select .cse12 4) 0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse15 (select (store (store |#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) .cse11))) (and (= .cse10 .cse15) (= (store .cse15 4 .cse11) v_DerPreprocessor_4)))))))))) [2023-11-28 23:45:50,819 INFO L899 garLoopResultBuilder]: For program point L619-3(lines 619 622) no Hoare annotation was computed. [2023-11-28 23:45:50,819 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-28 23:45:50,819 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 612) no Hoare annotation was computed. [2023-11-28 23:45:50,819 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2023-11-28 23:45:50,819 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2023-11-28 23:45:50,819 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-28 23:45:50,819 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 614 629) no Hoare annotation was computed. [2023-11-28 23:45:50,820 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse1 .cse2 .cse3 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (let ((.cse4 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and .cse0 (not (= .cse4 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1))))) [2023-11-28 23:45:50,820 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2023-11-28 23:45:50,820 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-11-28 23:45:50,820 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-11-28 23:45:50,820 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) [2023-11-28 23:45:50,820 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-11-28 23:45:50,823 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-11-28 23:45:50,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:45:50,839 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-11-28 23:45:50,842 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-11-28 23:45:50,842 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-11-28 23:45:50,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_7 : [int]int, v_DerPreprocessor_6 : int, v_DerPreprocessor_8 : [int]int, v_DerPreprocessor_5 : int, v_arrayElimCell_27 : int :: (((((((((#memory_$Pointer$#1.base[~#s~0!base][0] == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0] && #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4] == v_DerPreprocessor_5) && #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]] == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]][0 := #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0]]) && #memory_$Pointer$#2.offset[v_arrayElimCell_27][0] == 0) && #memory_$Pointer$#2.offset[v_arrayElimCell_27][4] == 0) && #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0]][4] == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]) && v_DerPreprocessor_6 == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0]) && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]][0] == 0) && !(v_arrayElimCell_27 == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0])) && #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4] == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0]) && #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]] == v_DerPreprocessor_7) could not be translated [2023-11-28 23:45:50,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-11-28 23:45:50,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated [2023-11-28 23:45:50,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated [2023-11-28 23:45:50,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated [2023-11-28 23:45:50,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated [2023-11-28 23:45:50,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated [2023-11-28 23:45:50,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated [2023-11-28 23:45:50,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int :: #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4] := v_DerPreprocessor_1][#memory_$Pointer$#1.base[~#s~0!base][0] := #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4 := #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]]][#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]] == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]]) could not be translated [2023-11-28 23:45:50,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated [2023-11-28 23:45:50,845 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_3 : [int]int, v_DerPreprocessor_4 : [int]int :: #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]] == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0] := v_DerPreprocessor_3][#memory_$Pointer$#1.base[~#s~0!base][0] := v_DerPreprocessor_4][#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]] && #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0] := v_DerPreprocessor_3][#memory_$Pointer$#1.base[~#s~0!base][0] := v_DerPreprocessor_4][#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][4 := #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]] == v_DerPreprocessor_4) could not be translated [2023-11-28 23:45:50,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-28 23:45:50,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0] could not be translated [2023-11-28 23:45:50,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][0] could not be translated [2023-11-28 23:45:50,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0] could not be translated [2023-11-28 23:45:50,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:45:50 BoogieIcfgContainer [2023-11-28 23:45:50,847 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:45:50,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:45:50,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:45:50,848 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:45:50,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:45:34" (3/4) ... [2023-11-28 23:45:50,851 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-28 23:45:50,855 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-28 23:45:50,859 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-28 23:45:50,859 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-28 23:45:50,860 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-28 23:45:50,860 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-28 23:45:50,942 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-28 23:45:50,942 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-28 23:45:50,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:45:50,943 INFO L158 Benchmark]: Toolchain (without parser) took 17727.44ms. Allocated memory was 151.0MB in the beginning and 429.9MB in the end (delta: 278.9MB). Free memory was 104.0MB in the beginning and 261.0MB in the end (delta: -157.0MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2023-11-28 23:45:50,943 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:45:50,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.67ms. Allocated memory is still 151.0MB. Free memory was 103.8MB in the beginning and 86.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-28 23:45:50,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.90ms. Allocated memory is still 151.0MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:45:50,944 INFO L158 Benchmark]: Boogie Preprocessor took 52.72ms. Allocated memory is still 151.0MB. Free memory was 83.9MB in the beginning and 81.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:45:50,944 INFO L158 Benchmark]: RCFGBuilder took 436.38ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 81.0MB in the beginning and 166.0MB in the end (delta: -85.0MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-11-28 23:45:50,945 INFO L158 Benchmark]: TraceAbstraction took 16704.13ms. Allocated memory was 201.3MB in the beginning and 429.9MB in the end (delta: 228.6MB). Free memory was 164.9MB in the beginning and 266.3MB in the end (delta: -101.4MB). Peak memory consumption was 126.1MB. Max. memory is 16.1GB. [2023-11-28 23:45:50,945 INFO L158 Benchmark]: Witness Printer took 94.13ms. Allocated memory is still 429.9MB. Free memory was 266.3MB in the beginning and 261.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-28 23:45:50,947 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.16ms. Allocated memory is still 151.0MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.67ms. Allocated memory is still 151.0MB. Free memory was 103.8MB in the beginning and 86.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.90ms. Allocated memory is still 151.0MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.72ms. Allocated memory is still 151.0MB. Free memory was 83.9MB in the beginning and 81.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.38ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 81.0MB in the beginning and 166.0MB in the end (delta: -85.0MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16704.13ms. Allocated memory was 201.3MB in the beginning and 429.9MB in the end (delta: 228.6MB). Free memory was 164.9MB in the beginning and 266.3MB in the end (delta: -101.4MB). Peak memory consumption was 126.1MB. Max. memory is 16.1GB. * Witness Printer took 94.13ms. Allocated memory is still 429.9MB. Free memory was 266.3MB in the beginning and 261.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_7 : [int]int, v_DerPreprocessor_6 : int, v_DerPreprocessor_8 : [int]int, v_DerPreprocessor_5 : int, v_arrayElimCell_27 : int :: (((((((((#memory_$Pointer$#1.base[~#s~0!base][0] == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0] && #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4] == v_DerPreprocessor_5) && #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]] == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]][0 := #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0]]) && #memory_$Pointer$#2.offset[v_arrayElimCell_27][0] == 0) && #memory_$Pointer$#2.offset[v_arrayElimCell_27][4] == 0) && #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0]][4] == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]) && v_DerPreprocessor_6 == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0]) && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]][0] == 0) && !(v_arrayElimCell_27 == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0])) && #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4] == #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][0]) && #memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][#memory_$Pointer$#2.base[v_DerPreprocessor_5 := v_DerPreprocessor_7][v_DerPreprocessor_6 := v_DerPreprocessor_8][v_arrayElimCell_27][4]] == v_DerPreprocessor_7) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int :: #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4] := v_DerPreprocessor_1][#memory_$Pointer$#1.base[~#s~0!base][0] := #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4 := #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]]][#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]] == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_3 : [int]int, v_DerPreprocessor_4 : [int]int :: #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]] == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0] := v_DerPreprocessor_3][#memory_$Pointer$#1.base[~#s~0!base][0] := v_DerPreprocessor_4][#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]] && #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0] := v_DerPreprocessor_3][#memory_$Pointer$#1.base[~#s~0!base][0] := v_DerPreprocessor_4][#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][4 := #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]] == v_DerPreprocessor_4) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0] 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: 627]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 757 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 61 IncrementalHoareTripleChecker+Unchecked, 618 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 871 IncrementalHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 139 mSDtfsCounter, 871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 613 HoareAnnotationTreeSize, 7 FomulaSimplifications, 157 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 49 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 346 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 379 ConstructedInterpolants, 10 QuantifiedInterpolants, 2992 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1738 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 120/147 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: ((((2 <= i) && (len == 2)) || ((i == 1) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((2 == len) && (len == 2)) || ((len == 2) && (len <= 1))) RESULT: Ultimate proved your program to be correct! [2023-11-28 23:45:50,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8579974d-2faa-423b-8466-74e433c5a495/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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