./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx --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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:14:25,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:14:25,588 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:14:25,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:14:25,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:14:25,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:14:25,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:14:25,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:14:25,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:14:25,640 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:14:25,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:14:25,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:14:25,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:14:25,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:14:25,645 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:14:25,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:14:25,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:14:25,646 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:14:25,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:14:25,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:14:25,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:14:25,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:14:25,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:14:25,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:14:25,649 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:14:25,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:14:25,650 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:14:25,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:14:25,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:14:25,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:14:25,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:14:25,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:25,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:14:25,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:14:25,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:14:25,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:14:25,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:14:25,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:14:25,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:14:25,656 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:14:25,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:14:25,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:14:25,657 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_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/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_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2023-11-21 22:14:25,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:14:26,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:14:26,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:14:26,006 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:14:26,007 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:14:26,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-21 22:14:29,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:14:29,466 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:14:29,466 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-21 22:14:29,489 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/data/f6ca107a8/5d0753851d0d4859bd55a36f9b9e23f6/FLAG8b682166a [2023-11-21 22:14:29,502 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/data/f6ca107a8/5d0753851d0d4859bd55a36f9b9e23f6 [2023-11-21 22:14:29,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:14:29,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:14:29,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:29,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:14:29,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:14:29,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1debc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29, skipping insertion in model container [2023-11-21 22:14:29,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,581 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:14:29,892 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_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2023-11-21 22:14:29,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:29,911 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:14:29,999 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_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2023-11-21 22:14:30,004 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:30,042 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:14:30,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30 WrapperNode [2023-11-21 22:14:30,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:30,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:30,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:14:30,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:14:30,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,115 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2023-11-21 22:14:30,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:30,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:14:30,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:14:30,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:14:30,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,136 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,158 INFO L187 HeapSplitter]: Split 20 memory accesses to 3 slices as follows [2, 13, 5] [2023-11-21 22:14:30,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:14:30,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:14:30,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:14:30,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:14:30,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (1/1) ... [2023-11-21 22:14:30,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:14:30,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:30,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:14:30,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:14:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:14:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:14:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 22:14:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:14:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:14:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 22:14:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-21 22:14:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-21 22:14:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:14:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:14:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:14:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 22:14:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 22:14:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-21 22:14:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 22:14:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 22:14:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 22:14:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:14:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 22:14:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 22:14:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 22:14:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:14:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:14:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 22:14:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:14:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:14:30,438 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:14:30,440 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:14:30,771 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:14:30,912 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:14:30,913 INFO L308 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-21 22:14:30,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:30 BoogieIcfgContainer [2023-11-21 22:14:30,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:14:30,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:14:30,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:14:30,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:14:30,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:14:29" (1/3) ... [2023-11-21 22:14:30,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629afb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:30, skipping insertion in model container [2023-11-21 22:14:30,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:30" (2/3) ... [2023-11-21 22:14:30,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629afb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:14:30, skipping insertion in model container [2023-11-21 22:14:30,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:30" (3/3) ... [2023-11-21 22:14:30,923 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2023-11-21 22:14:30,941 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:14:30,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 22:14:30,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:14:30,995 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;@78fc7db2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:14:30,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:14:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 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-21 22:14:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-21 22:14:31,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:31,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:31,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:31,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1377697261, now seen corresponding path program 1 times [2023-11-21 22:14:31,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:31,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659262788] [2023-11-21 22:14:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:31,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:31,564 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-21 22:14:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659262788] [2023-11-21 22:14:31,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659262788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:31,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:31,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:14:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286895576] [2023-11-21 22:14:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:31,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:14:31,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:31,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:14:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:14:31,633 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:14:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:31,763 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2023-11-21 22:14:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:14:31,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-21 22:14:31,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:31,774 INFO L225 Difference]: With dead ends: 43 [2023-11-21 22:14:31,774 INFO L226 Difference]: Without dead ends: 21 [2023-11-21 22:14:31,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:14:31,781 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:31,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:14:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-21 22:14:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-11-21 22:14:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-21 22:14:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2023-11-21 22:14:31,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 11 [2023-11-21 22:14:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:31,824 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2023-11-21 22:14:31,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:14:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2023-11-21 22:14:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 22:14:31,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:31,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:31,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:14:31,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:31,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash -4769702, now seen corresponding path program 1 times [2023-11-21 22:14:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:31,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193621726] [2023-11-21 22:14:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:31,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:14:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:32,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193621726] [2023-11-21 22:14:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193621726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91077707] [2023-11-21 22:14:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:32,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:32,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:32,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:14:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:14:32,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:14:32,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91077707] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:14:32,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:14:32,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-11-21 22:14:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578715553] [2023-11-21 22:14:32,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:32,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:14:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:32,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:14:32,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:14:32,523 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-21 22:14:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:32,644 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2023-11-21 22:14:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:14:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2023-11-21 22:14:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:32,647 INFO L225 Difference]: With dead ends: 36 [2023-11-21 22:14:32,647 INFO L226 Difference]: Without dead ends: 22 [2023-11-21 22:14:32,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:14:32,649 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:32,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:14:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-21 22:14:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-21 22:14:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:14:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-11-21 22:14:32,667 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 17 [2023-11-21 22:14:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:32,668 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-11-21 22:14:32,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-21 22:14:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-11-21 22:14:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-21 22:14:32,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:32,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:32,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-21 22:14:32,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:32,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:32,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash 438721889, now seen corresponding path program 2 times [2023-11-21 22:14:32,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:32,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125099924] [2023-11-21 22:14:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:32,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:33,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:14:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-21 22:14:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 22:14:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125099924] [2023-11-21 22:14:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125099924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902673787] [2023-11-21 22:14:33,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:14:33,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:33,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:33,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:33,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:14:33,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-21 22:14:33,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:14:33,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:14:33,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 22:14:33,577 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:33,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902673787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:33,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:14:33,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-21 22:14:33,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825258355] [2023-11-21 22:14:33,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:33,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:14:33,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:33,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:14:33,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:14:33,580 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-21 22:14:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:33,632 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2023-11-21 22:14:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:14:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-21 22:14:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:33,634 INFO L225 Difference]: With dead ends: 31 [2023-11-21 22:14:33,634 INFO L226 Difference]: Without dead ends: 23 [2023-11-21 22:14:33,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:14:33,636 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:33,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 33 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:14:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-21 22:14:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-21 22:14:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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-21 22:14:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-11-21 22:14:33,644 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 23 [2023-11-21 22:14:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:33,644 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-11-21 22:14:33,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-21 22:14:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-11-21 22:14:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 22:14:33,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:33,646 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:33,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-21 22:14:33,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:33,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:33,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash 617430222, now seen corresponding path program 1 times [2023-11-21 22:14:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:33,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86416957] [2023-11-21 22:14:33,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:33,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:14:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:35,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-21 22:14:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:14:36,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:36,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86416957] [2023-11-21 22:14:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86416957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879258835] [2023-11-21 22:14:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:36,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:36,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:36,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:14:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:36,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-21 22:14:36,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:36,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:14:36,790 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-21 22:14:36,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 22:14:37,350 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 22:14:37,351 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-21 22:14:37,399 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:14:37,399 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:14:37,787 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 59 treesize of output 35 [2023-11-21 22:14:37,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-21 22:14:37,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:14:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:37,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:38,676 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|)) (.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3 (select .cse7 |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse1 (= 0 .cse3)) (.cse0 (= .cse2 0))) (and (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and .cse0 .cse1) (forall ((v_DerPreprocessor_1 Int) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| .cse2 (store (select |c_#memory_int#1| .cse2) (+ 4 .cse3) v_DerPreprocessor_1)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_521) .cse4) .cse5) |c_ULTIMATE.start_main_~data~0#1|)) (and (= .cse5 0) (= .cse4 0)))) (or (not .cse1) (not .cse0) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_insert_~head#1.offset| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_sll_insert_~new_node~0#1.offset_24| Int) (v_ArrVal_521 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_insert_~new_node~0#1.offset_24| |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_521) .cse6) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_insert_~head#1.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.offset_24|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (= .cse6 0)) (forall ((|v_ULTIMATE.start_sll_insert_~new_node~0#1.offset_24| Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_insert_~head#1.offset| |v_ULTIMATE.start_sll_insert_~new_node~0#1.offset_24|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< |v_ULTIMATE.start_sll_insert_~new_node~0#1.offset_24| |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_521) .cse6) .cse8)) (= .cse8 0))))))))))) is different from false [2023-11-21 22:14:39,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879258835] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:39,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:14:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-11-21 22:14:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619409690] [2023-11-21 22:14:39,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:39,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-21 22:14:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:39,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-21 22:14:39,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=891, Unknown=22, NotChecked=60, Total=1056 [2023-11-21 22:14:39,316 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-21 22:14:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:40,208 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2023-11-21 22:14:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-21 22:14:40,209 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-21 22:14:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:40,210 INFO L225 Difference]: With dead ends: 31 [2023-11-21 22:14:40,210 INFO L226 Difference]: Without dead ends: 29 [2023-11-21 22:14:40,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=1199, Unknown=24, NotChecked=70, Total=1406 [2023-11-21 22:14:40,212 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:40,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 169 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-21 22:14:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-21 22:14:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-11-21 22:14:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 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-21 22:14:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2023-11-21 22:14:40,221 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 24 [2023-11-21 22:14:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:40,222 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2023-11-21 22:14:40,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-21 22:14:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2023-11-21 22:14:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-21 22:14:40,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:40,223 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:40,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:14:40,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:40,436 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:40,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash 617509303, now seen corresponding path program 1 times [2023-11-21 22:14:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459256395] [2023-11-21 22:14:40,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:41,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:14:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:41,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-21 22:14:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:14:41,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459256395] [2023-11-21 22:14:41,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459256395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514421828] [2023-11-21 22:14:41,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:41,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:41,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:41,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:14:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:41,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-21 22:14:41,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:41,663 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 16 treesize of output 8 [2023-11-21 22:14:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:41,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514421828] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:14:42,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:14:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2023-11-21 22:14:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197296320] [2023-11-21 22:14:42,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:42,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-21 22:14:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:42,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-21 22:14:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2023-11-21 22:14:42,053 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 19 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-21 22:14:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:42,744 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2023-11-21 22:14:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:14:42,745 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 19 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-21 22:14:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:42,746 INFO L225 Difference]: With dead ends: 40 [2023-11-21 22:14:42,746 INFO L226 Difference]: Without dead ends: 34 [2023-11-21 22:14:42,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2023-11-21 22:14:42,748 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:42,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 316 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 22:14:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-21 22:14:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-11-21 22:14:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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-21 22:14:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-11-21 22:14:42,762 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 24 [2023-11-21 22:14:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:42,762 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-11-21 22:14:42,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 19 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-21 22:14:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-11-21 22:14:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-21 22:14:42,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:42,765 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:42,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:14:42,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:42,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:42,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1862421249, now seen corresponding path program 2 times [2023-11-21 22:14:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480365804] [2023-11-21 22:14:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:43,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:14:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-21 22:14:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 22:14:43,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:43,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480365804] [2023-11-21 22:14:43,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480365804] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:43,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430920638] [2023-11-21 22:14:43,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:14:43,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:43,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:43,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:43,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 22:14:43,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:14:43,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:14:43,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-21 22:14:43,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 22:14:43,593 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:14:43,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430920638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:43,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:14:43,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-11-21 22:14:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813766830] [2023-11-21 22:14:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:43,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:14:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:14:43,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:14:43,595 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (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-21 22:14:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:43,668 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-21 22:14:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:14:43,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-21 22:14:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:43,670 INFO L225 Difference]: With dead ends: 34 [2023-11-21 22:14:43,670 INFO L226 Difference]: Without dead ends: 25 [2023-11-21 22:14:43,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:14:43,671 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:43,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 34 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:14:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-21 22:14:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-21 22:14:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-21 22:14:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-21 22:14:43,685 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 25 [2023-11-21 22:14:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:43,685 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-21 22:14:43,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (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-21 22:14:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-21 22:14:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-21 22:14:43,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:43,687 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:43,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:14:43,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:43,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:43,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 644968873, now seen corresponding path program 1 times [2023-11-21 22:14:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:43,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343535390] [2023-11-21 22:14:43,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:14:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-21 22:14:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 22:14:44,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:44,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343535390] [2023-11-21 22:14:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343535390] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708467789] [2023-11-21 22:14:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:44,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:44,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:44,418 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:44,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 22:14:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 22:14:44,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 22:14:44,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 22:14:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708467789] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:14:44,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:14:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2023-11-21 22:14:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33893062] [2023-11-21 22:14:44,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:44,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-21 22:14:44,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:44,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-21 22:14:44,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-11-21 22:14:44,780 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 22:14:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:45,082 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-11-21 22:14:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:14:45,083 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-21 22:14:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:14:45,083 INFO L225 Difference]: With dead ends: 34 [2023-11-21 22:14:45,084 INFO L226 Difference]: Without dead ends: 26 [2023-11-21 22:14:45,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-11-21 22:14:45,085 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:14:45,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 80 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:14:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-21 22:14:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-21 22:14:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:14:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-11-21 22:14:45,095 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 26 [2023-11-21 22:14:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:14:45,096 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-21 22:14:45,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 22:14:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-11-21 22:14:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-21 22:14:45,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:14:45,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:45,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 22:14:45,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-21 22:14:45,319 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:14:45,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash 645047954, now seen corresponding path program 1 times [2023-11-21 22:14:45,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:45,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249221540] [2023-11-21 22:14:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:47,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:47,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:14:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:47,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-21 22:14:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:14:47,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:47,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249221540] [2023-11-21 22:14:47,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249221540] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:47,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360262232] [2023-11-21 22:14:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:47,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:47,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:47,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:47,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dfe5cf1-931a-4fe2-86ec-d84c3b916517/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 22:14:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:47,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-21 22:14:47,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:47,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:14:48,115 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:14:48,159 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:14:48,159 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:14:48,451 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 113 treesize of output 77 [2023-11-21 22:14:48,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-11-21 22:14:48,475 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-21 22:14:48,476 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 142 [2023-11-21 22:14:48,481 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 132 treesize of output 96 [2023-11-21 22:14:48,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:14:48,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2023-11-21 22:14:48,493 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 30 treesize of output 17 [2023-11-21 22:14:48,499 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2023-11-21 22:14:48,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-21 22:14:48,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-21 22:14:48,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-21 22:14:48,658 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 15 treesize of output 7 [2023-11-21 22:14:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:14:48,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:48,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:14:48,793 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2023-11-21 22:14:48,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:14:48,811 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 10 [2023-11-21 22:14:48,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:14:48,850 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 184 [2023-11-21 22:14:48,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:14:48,869 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 238 [2023-11-21 22:14:48,885 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 41 treesize of output 33 [2023-11-21 22:14:48,899 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 33 treesize of output 25 [2023-11-21 22:14:49,573 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse14)) (.cse4 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0))) (let ((.cse12 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse5 (and .cse4 .cse3)) (.cse6 (not .cse13)) (.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (and (or (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1239 Int) (v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse0 .cse1 v_ArrVal_1239)) v_arrayElimCell_20) v_arrayElimCell_22) |c_ULTIMATE.start_main_~uneq~0#1|)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (or (forall ((v_DerPreprocessor_6 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse0 .cse1 v_ArrVal_1239)) v_arrayElimCell_24) v_arrayElimCell_25)))) (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse0 .cse1 v_ArrVal_1239)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse2 v_arrayElimCell_24) v_arrayElimCell_25)) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= (select (select .cse2 v_arrayElimCell_20) v_arrayElimCell_22) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (not .cse3) (not .cse4)) (or .cse5 (and (or .cse6 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_7))) (store .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_24) v_arrayElimCell_25)))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse9 .cse1 v_ArrVal_1239)) v_arrayElimCell_24) v_arrayElimCell_25)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))))) (or (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int) (v_arrayElimCell_22 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) (or (= (select .cse10 v_arrayElimCell_22) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse10) v_arrayElimCell_24) v_arrayElimCell_25)))))) .cse12) (or (and (forall ((v_DerPreprocessor_7 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (or .cse12 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_1239 Int) (v_arrayElimCell_22 Int)) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239) v_arrayElimCell_22) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse13))) (or (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse14) .cse5 (and (forall ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (let ((.cse15 (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_4))) (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))))) (or (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= (select (select .cse15 v_arrayElimCell_20) v_arrayElimCell_22) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_24) v_arrayElimCell_25))))) (or .cse6 (forall ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_4))) (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_24) v_arrayElimCell_25)))) (or .cse13 (forall ((v_DerPreprocessor_4 (Array Int Int)) (v_ArrVal_1239 Int) (v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= (select (select (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_4))) (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_20) v_arrayElimCell_22) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse12 .cse5 (and (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (let ((.cse19 (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_5))) (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))))) (or (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_20) v_arrayElimCell_22))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_24) v_arrayElimCell_25))))) (or .cse6 (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_5))) (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_24) v_arrayElimCell_25)))) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_ArrVal_1239 Int) (v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_DerPreprocessor_5))) (store .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_20) v_arrayElimCell_22))) .cse13))))))) is different from false [2023-11-21 22:14:49,852 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse14)) (.cse3 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| 0)) (.cse4 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 0))) (let ((.cse5 (and .cse3 .cse4)) (.cse11 (not .cse13)) (.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse6 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1239 Int) (v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse0 .cse1 v_ArrVal_1239)) v_arrayElimCell_20) v_arrayElimCell_22) |c_ULTIMATE.start_main_~uneq~0#1|)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (or (forall ((v_DerPreprocessor_6 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse0 .cse1 v_ArrVal_1239)) v_arrayElimCell_24) v_arrayElimCell_25)))) (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse0 .cse1 v_ArrVal_1239)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse2 v_arrayElimCell_24) v_arrayElimCell_25)) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= (select (select .cse2 v_arrayElimCell_20) v_arrayElimCell_22) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (not .cse3) (not .cse4)) (or .cse5 (and (or .cse6 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int) (v_arrayElimCell_22 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_7))) (let ((.cse7 (store (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 v_arrayElimCell_22)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse7) v_arrayElimCell_24) v_arrayElimCell_25))))))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_7))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse9 .cse1 v_ArrVal_1239)) v_arrayElimCell_24) v_arrayElimCell_25)))))) (or .cse11 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_7))) (store .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_24) v_arrayElimCell_25)))) (or (and (or .cse6 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_1239 Int) (v_arrayElimCell_22 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239) v_arrayElimCell_22)))) (forall ((v_DerPreprocessor_7 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) .cse13))) (or (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse14) .cse5 (and (or (forall ((v_DerPreprocessor_4 (Array Int Int)) (v_ArrVal_1239 Int) (v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_4))) (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_20) v_arrayElimCell_22))) .cse13) (or (forall ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_4))) (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_24) v_arrayElimCell_25))) .cse11) (forall ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (let ((.cse17 (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_4))) (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))))) (or (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_20) v_arrayElimCell_22))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_24) v_arrayElimCell_25))))))) (or .cse5 (and (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (let ((.cse19 (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_5))) (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))))) (or (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_20) v_arrayElimCell_22))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_24) v_arrayElimCell_25))))) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (v_ArrVal_1239 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_5))) (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_24) v_arrayElimCell_25))) .cse11) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_ArrVal_1239 Int) (v_arrayElimCell_20 Int) (v_arrayElimCell_22 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_DerPreprocessor_5))) (store .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1239))) v_arrayElimCell_20) v_arrayElimCell_22))) .cse13)) .cse6))))) is different from false [2023-11-21 22:14:58,853 WARN L293 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 774 DAG size of output: 729 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-21 22:14:58,854 INFO L349 Elim1Store]: treesize reduction 225, result has 86.4 percent of original size [2023-11-21 22:14:58,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 16 new quantified variables, introduced 121 case distinctions, treesize of input 2662 treesize of output 3668 [2023-11-21 22:15:00,156 INFO L224 Elim1Store]: Index analysis took 297 ms [2023-11-21 22:15:02,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:02,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 2130 treesize of output 3006 [2023-11-21 22:15:03,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:03,669 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 1829 treesize of output 1830 [2023-11-21 22:15:04,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:04,745 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 1821 treesize of output 1793 [2023-11-21 22:15:05,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:05,687 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 1801 treesize of output 1802 [2023-11-21 22:15:06,736 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 1813 treesize of output 1807 [2023-11-21 22:15:07,693 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 1817 treesize of output 1815 [2023-11-21 22:15:08,549 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 1815 treesize of output 1813 [2023-11-21 22:15:09,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:09,478 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 1853 treesize of output 1850 [2023-11-21 22:15:10,356 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 1861 treesize of output 1855 [2023-11-21 22:15:11,164 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 1875 treesize of output 1869 [2023-11-21 22:15:12,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:15:12,099 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 1909 treesize of output 1906 [2023-11-21 22:15:13,230 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 1917 treesize of output 1911 [2023-11-21 22:15:14,108 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 1931 treesize of output 1925