./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu --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 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:58:34,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:58:34,369 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:58:34,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:58:34,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:58:34,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:58:34,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:58:34,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:58:34,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:58:34,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:58:34,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:58:34,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:58:34,429 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:58:34,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:58:34,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:58:34,431 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:58:34,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:58:34,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:58:34,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:58:34,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:58:34,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:58:34,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:58:34,436 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:58:34,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:58:34,437 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:58:34,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:58:34,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:58:34,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:58:34,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:34,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:58:34,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:58:34,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:58:34,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:58:34,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:58:34,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:58:34,442 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:58:34,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:58:34,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:58:34,443 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:58:34,443 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_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/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_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu 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 -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2023-11-19 07:58:34,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:58:34,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:58:34,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:58:34,820 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:58:34,820 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:58:34,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-11-19 07:58:38,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:58:38,429 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:58:38,430 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2023-11-19 07:58:38,447 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/data/7cfab6d83/c0bd5ae3bc284e88836cebbc996965be/FLAG9d008944f [2023-11-19 07:58:38,475 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/data/7cfab6d83/c0bd5ae3bc284e88836cebbc996965be [2023-11-19 07:58:38,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:58:38,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:58:38,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:38,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:58:38,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:58:38,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:38" (1/1) ... [2023-11-19 07:58:38,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4960693a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:38, skipping insertion in model container [2023-11-19 07:58:38,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:38" (1/1) ... [2023-11-19 07:58:38,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:58:38,949 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_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-11-19 07:58:38,955 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:38,969 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:58:39,057 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_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2023-11-19 07:58:39,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:39,107 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:58:39,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39 WrapperNode [2023-11-19 07:58:39,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:39,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:39,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:58:39,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:58:39,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,201 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2023-11-19 07:58:39,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:39,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:58:39,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:58:39,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:58:39,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:58:39,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:58:39,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:58:39,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:58:39,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (1/1) ... [2023-11-19 07:58:39,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:39,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:58:39,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:58:39,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:58:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:58:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:58:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 07:58:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 07:58:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:58:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:58:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:58:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:58:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:58:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:58:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 07:58:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:58:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:58:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:58:39,487 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:58:39,490 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:58:39,860 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:58:39,876 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:58:39,876 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 07:58:39,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:39 BoogieIcfgContainer [2023-11-19 07:58:39,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:58:39,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:58:39,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:58:39,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:58:39,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:58:38" (1/3) ... [2023-11-19 07:58:39,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21813541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:39, skipping insertion in model container [2023-11-19 07:58:39,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:39" (2/3) ... [2023-11-19 07:58:39,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21813541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:39, skipping insertion in model container [2023-11-19 07:58:39,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:39" (3/3) ... [2023-11-19 07:58:39,895 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2023-11-19 07:58:39,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:58:39,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:58:39,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:58:39,972 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;@35181f29, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:58:39,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:58:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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-19 07:58:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 07:58:39,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:39,988 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:39,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:39,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:39,996 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2023-11-19 07:58:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:40,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90635123] [2023-11-19 07:58:40,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:40,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:58:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:40,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:58:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:58:40,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:40,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90635123] [2023-11-19 07:58:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90635123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963613973] [2023-11-19 07:58:40,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:40,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:40,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:40,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:40,502 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:58:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:40,600 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-11-19 07:58:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:40,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-19 07:58:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:40,612 INFO L225 Difference]: With dead ends: 61 [2023-11-19 07:58:40,612 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:58:40,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:40,620 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:40,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:58:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:58:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-19 07:58:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-19 07:58:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-19 07:58:40,671 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2023-11-19 07:58:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:40,673 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-19 07:58:40,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:58:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-11-19 07:58:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 07:58:40,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:40,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:40,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:58:40,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:40,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2023-11-19 07:58:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:40,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680460249] [2023-11-19 07:58:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:58:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:40,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:58:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:58:40,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:40,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680460249] [2023-11-19 07:58:40,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680460249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:40,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:40,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:58:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022382593] [2023-11-19 07:58:40,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:40,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:58:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:40,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:58:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:58:40,929 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:58:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:41,002 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2023-11-19 07:58:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:58:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-19 07:58:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:41,004 INFO L225 Difference]: With dead ends: 50 [2023-11-19 07:58:41,004 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 07:58:41,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:58:41,007 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:41,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:58:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 07:58:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-11-19 07:58:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:58:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-19 07:58:41,017 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-11-19 07:58:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:41,017 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-19 07:58:41,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:58:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-19 07:58:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 07:58:41,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:41,020 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:41,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:58:41,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:41,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:41,021 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2023-11-19 07:58:41,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:41,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778204894] [2023-11-19 07:58:41,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:41,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:58:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:41,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:41,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:58:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:42,023 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-19 07:58:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778204894] [2023-11-19 07:58:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778204894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:58:42,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020375078] [2023-11-19 07:58:42,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:42,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:58:42,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:58:42,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:58:42,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:58:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:42,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-19 07:58:42,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:58:42,441 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 8 treesize of output 4 [2023-11-19 07:58:42,489 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-19 07:58:42,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:42,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-19 07:58:42,550 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-19 07:58:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-19 07:58:42,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:58:42,623 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_7| Int) (v_ArrVal_420 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_7| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_7| v_ArrVal_420) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))) is different from false [2023-11-19 07:58:42,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020375078] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:58:42,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:58:42,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2023-11-19 07:58:42,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170772393] [2023-11-19 07:58:42,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:58:42,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-19 07:58:42,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:42,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-19 07:58:42,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=293, Unknown=2, NotChecked=70, Total=420 [2023-11-19 07:58:42,630 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:58:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:43,166 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2023-11-19 07:58:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:58:43,167 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2023-11-19 07:58:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:43,168 INFO L225 Difference]: With dead ends: 55 [2023-11-19 07:58:43,168 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 07:58:43,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=556, Unknown=2, NotChecked=98, Total=756 [2023-11-19 07:58:43,170 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:43,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 182 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2023-11-19 07:58:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 07:58:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-19 07:58:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:58:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-19 07:58:43,186 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 34 [2023-11-19 07:58:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:43,186 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-19 07:58:43,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:58:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-19 07:58:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 07:58:43,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:43,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:43,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:58:43,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:58:43,411 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:43,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2023-11-19 07:58:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69315680] [2023-11-19 07:58:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:47,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:58:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:48,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:58:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:58:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:48,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69315680] [2023-11-19 07:58:48,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69315680] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:58:48,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220156044] [2023-11-19 07:58:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:48,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:58:48,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:58:48,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:58:48,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:58:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 130 conjunts are in the unsatisfiable core [2023-11-19 07:58:49,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:58:49,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 07:58:49,663 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 5 treesize of output 3 [2023-11-19 07:58:49,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:49,842 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 12 treesize of output 14 [2023-11-19 07:58:50,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:50,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:58:50,185 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-19 07:58:50,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:50,347 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-19 07:58:50,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-19 07:58:50,531 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 07:58:50,721 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-19 07:58:51,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:51,088 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 27 [2023-11-19 07:58:51,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-19 07:58:51,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:51,111 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 22 treesize of output 22 [2023-11-19 07:58:51,119 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 12 treesize of output 1 [2023-11-19 07:58:51,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:58:51,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 34 [2023-11-19 07:58:51,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:51,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-19 07:58:51,502 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 7 treesize of output 3 [2023-11-19 07:58:51,508 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 7 treesize of output 3 [2023-11-19 07:58:51,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:51,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:51,844 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-19 07:58:51,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-19 07:58:53,991 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (or (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 8) 1) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0)) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse4) 4)) (.cse3 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_#memory_$Pointer$.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3) (not (= .cse2 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= (select (select |c_#memory_int| .cse4) 8) 1) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$.base| .cse3)) |c_#memory_$Pointer$.base|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_#memory_$Pointer$.offset|))) (and (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse5 (select |c_#memory_$Pointer$.offset| .cse5))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-19 07:58:53,997 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (or (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse1) 8) 1) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0)) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse4) 4)) (.cse3 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_#memory_$Pointer$.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3) (not (= .cse2 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= (select (select |c_#memory_int| .cse4) 8) 1) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse3 (select |c_#memory_$Pointer$.base| .cse3)) |c_#memory_$Pointer$.base|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_#memory_$Pointer$.offset|))) (and (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse5 (select |c_#memory_$Pointer$.offset| .cse5))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-19 07:58:54,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,474 INFO L349 Elim1Store]: treesize reduction 249, result has 8.1 percent of original size [2023-11-19 07:58:54,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 831 treesize of output 408 [2023-11-19 07:58:54,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,552 INFO L349 Elim1Store]: treesize reduction 103, result has 9.6 percent of original size [2023-11-19 07:58:54,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 356 treesize of output 237 [2023-11-19 07:58:54,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,621 INFO L349 Elim1Store]: treesize reduction 94, result has 14.5 percent of original size [2023-11-19 07:58:54,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 317 treesize of output 233 [2023-11-19 07:58:54,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 97 [2023-11-19 07:58:54,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2023-11-19 07:58:54,683 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 26 treesize of output 15 [2023-11-19 07:58:54,697 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 23 treesize of output 1 [2023-11-19 07:58:54,704 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 39 treesize of output 31 [2023-11-19 07:58:54,711 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 13 treesize of output 9 [2023-11-19 07:58:54,719 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 9 treesize of output 7 [2023-11-19 07:58:54,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:58:54,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2023-11-19 07:58:54,932 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 7 treesize of output 3 [2023-11-19 07:58:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:58:55,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:58:55,182 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_691 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_698 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_690 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse6 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9))) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) v_ArrVal_688)))) (store .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse6 v_ArrVal_698) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse7 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_691) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_693))) (store .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse6 v_ArrVal_684) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_686)))) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_689) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_685))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_690))) (select (select (store .cse4 .cse1 v_ArrVal_696) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_695) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))))) is different from false [2023-11-19 07:58:55,231 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_691 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_698 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_690 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse6 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9))) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) v_ArrVal_688)))) (store .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse6 v_ArrVal_698) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse7 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_691) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_693))) (store .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse6 v_ArrVal_684) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_686)))) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_689) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_685))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_690))) (select (select (store .cse4 .cse1 v_ArrVal_696) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse2 .cse1 v_ArrVal_695) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))))) is different from false [2023-11-19 07:58:55,431 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13| Int) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_711 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_710 (Array Int Int)) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_690 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13| v_ArrVal_710)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13| v_ArrVal_711))) (let ((.cse10 (select (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ 4 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse6 (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4)) (.cse3 (select (select .cse8 .cse10) .cse11))) (let ((.cse4 (let ((.cse9 (store (select .cse8 .cse3) (select (select .cse5 .cse10) .cse11) v_ArrVal_688))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse3 .cse9))) (store .cse7 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13| (store (store (select (store .cse8 .cse3 .cse9) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13|) .cse6 v_ArrVal_698) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| (select (select (store .cse7 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13| v_ArrVal_691) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_693) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13| (store (store (select (store .cse5 .cse3 v_ArrVal_693) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13|) .cse6 v_ArrVal_684) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_686))) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse3 v_ArrVal_689) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_13| v_ArrVal_685))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_690))) (select (select (store .cse4 .cse1 v_ArrVal_696) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse2 .cse1 v_ArrVal_695) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))))) is different from false [2023-11-19 07:58:55,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220156044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:58:55,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:58:55,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 43 [2023-11-19 07:58:55,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599983845] [2023-11-19 07:58:55,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:58:55,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-19 07:58:55,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:55,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-19 07:58:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1699, Unknown=5, NotChecked=340, Total=2162 [2023-11-19 07:58:55,442 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 43 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 34 states have internal predecessors, (51), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:58:59,303 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse18 0))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (let ((.cse0 (= (select (select |c_#memory_int| .cse5) 8) 1)) (.cse3 (not (= .cse2 .cse5))) (.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (.cse4 (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse15 (select (select |c_#memory_$Pointer$.offset| .cse16) 4)) (.cse12 (= (select .cse9 0) 0)) (.cse13 (select (select |c_#memory_$Pointer$.base| .cse16) 4)) (.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) (.cse1 (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (or (and (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 .cse3 (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) .cse4 (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse8) 4)) (.cse7 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_#memory_$Pointer$.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse7) (not (= .cse6 .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse8)) (= (select (select |c_#memory_int| .cse8) 8) 1) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 2 .cse6) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse7 (select |c_#memory_$Pointer$.base| .cse7)) |c_#memory_$Pointer$.base|)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse10) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse3 (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_#memory_$Pointer$.offset|))) (and (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse11)))) .cse12) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse14 (= .cse16 .cse13))) (or (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse13) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse13)) .cse14 (not (= .cse15 8))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse16)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse16) 8)) (not .cse14)))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse17)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse5) 1) (<= (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse10 1) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse16)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse4 (= .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) .cse12 (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| 8)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse13)) (<= (+ .cse17 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse17) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-19 07:58:59,311 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse18 0))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (let ((.cse0 (= (select (select |c_#memory_int| .cse5) 8) 1)) (.cse3 (not (= .cse2 .cse5))) (.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (.cse4 (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse15 (select (select |c_#memory_$Pointer$.offset| .cse16) 4)) (.cse12 (= (select .cse9 0) 0)) (.cse13 (select (select |c_#memory_$Pointer$.base| .cse16) 4)) (.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) (.cse1 (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) .cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (or (and (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 .cse3 (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) .cse4 (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse5))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int)))) (let ((.cse8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse8) 4)) (.cse7 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |c_#memory_$Pointer$.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse7) (not (= .cse6 .cse8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse8)) (= (select (select |c_#memory_int| .cse8) 8) 1) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ 2 .cse6) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| .cse7 (select |c_#memory_$Pointer$.base| .cse7)) |c_#memory_$Pointer$.base|)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse10) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse3 (or (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_#memory_$Pointer$.offset|))) (and (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse11)))) .cse12) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (let ((.cse14 (= .cse16 .cse13))) (or (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse13) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse13)) .cse14 (not (= .cse15 8))) (and (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse16)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse16) 8)) (not .cse14)))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse17)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse5) 1) (<= (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= .cse10 1) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse16)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse4 (= .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) .cse12 (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| 8)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse13)) (<= (+ .cse17 1) |c_#StackHeapBarrier|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse17) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from true [2023-11-19 07:59:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:00,121 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-11-19 07:59:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 07:59:00,122 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 34 states have internal predecessors, (51), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-11-19 07:59:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:00,124 INFO L225 Difference]: With dead ends: 52 [2023-11-19 07:59:00,124 INFO L226 Difference]: Without dead ends: 50 [2023-11-19 07:59:00,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=216, Invalid=2767, Unknown=7, NotChecked=550, Total=3540 [2023-11-19 07:59:00,127 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:00,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 285 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 801 Invalid, 0 Unknown, 98 Unchecked, 1.4s Time] [2023-11-19 07:59:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-19 07:59:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2023-11-19 07:59:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-19 07:59:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2023-11-19 07:59:00,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34 [2023-11-19 07:59:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:00,140 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2023-11-19 07:59:00,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 34 states have internal predecessors, (51), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:59:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2023-11-19 07:59:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 07:59:00,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:00,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:00,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:59:00,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:00,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:00,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash -665604212, now seen corresponding path program 1 times [2023-11-19 07:59:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:00,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601823126] [2023-11-19 07:59:00,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:04,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:59:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601823126] [2023-11-19 07:59:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601823126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:59:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664388517] [2023-11-19 07:59:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:04,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:04,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:04,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:59:04,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_246385a6-eaa1-4daf-a0cb-c3bb62bfbbad/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:59:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:05,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-19 07:59:05,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:05,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 07:59:05,104 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 5 treesize of output 3 [2023-11-19 07:59:05,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:05,264 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 12 treesize of output 14 [2023-11-19 07:59:05,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:05,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:59:05,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:05,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:05,641 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 07:59:05,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-11-19 07:59:05,768 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-19 07:59:05,920 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 07:59:05,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-19 07:59:06,280 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-11-19 07:59:06,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 106 [2023-11-19 07:59:06,290 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 86 treesize of output 63 [2023-11-19 07:59:06,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2023-11-19 07:59:06,626 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:59:06,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 31 [2023-11-19 07:59:06,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:06,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:06,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-19 07:59:06,645 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 7 treesize of output 3 [2023-11-19 07:59:06,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:06,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:59:06,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:06,962 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-19 07:59:06,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 59 [2023-11-19 07:59:06,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:06,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:06,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:06,997 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-19 07:59:06,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-19 07:59:07,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:07,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:08,058 INFO L349 Elim1Store]: treesize reduction 627, result has 9.8 percent of original size [2023-11-19 07:59:08,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 2724 treesize of output 1337 [2023-11-19 07:59:08,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:08,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:08,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:08,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:08,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:59:08,486 INFO L349 Elim1Store]: treesize reduction 691, result has 9.4 percent of original size [2023-11-19 07:59:08,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 750 treesize of output 978 [2023-11-19 07:59:08,897 INFO L190 IndexEqualityManager]: detected not equals via solver