./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/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_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/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_c966ea4f-81fd-4748-8b2f-18712e1c8542/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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:02:51,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:02:51,605 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:02:51,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:02:51,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:02:51,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:02:51,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:02:51,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:02:51,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:02:51,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:02:51,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:02:51,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:02:51,669 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:02:51,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:02:51,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:02:51,672 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:02:51,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:02:51,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:02:51,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:02:51,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:02:51,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:02:51,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:02:51,676 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:02:51,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:02:51,677 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:02:51,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:02:51,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:02:51,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:02:51,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:51,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:02:51,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:02:51,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:02:51,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:02:51,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:02:51,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:02:51,684 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:02:51,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:02:51,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:02:51,685 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:02:51,686 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_c966ea4f-81fd-4748-8b2f-18712e1c8542/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_c966ea4f-81fd-4748-8b2f-18712e1c8542/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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-11-19 08:02:51,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:02:52,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:02:52,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:02:52,041 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:02:52,042 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:02:52,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-19 08:02:55,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:02:55,585 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:02:55,585 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-19 08:02:55,603 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/data/7b3ea4b11/31e3060208b64f2cae341c05a66cf43b/FLAG1cb216786 [2023-11-19 08:02:55,620 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/data/7b3ea4b11/31e3060208b64f2cae341c05a66cf43b [2023-11-19 08:02:55,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:02:55,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:02:55,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:55,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:02:55,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:02:55,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:55" (1/1) ... [2023-11-19 08:02:55,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb0b3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:55, skipping insertion in model container [2023-11-19 08:02:55,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:55" (1/1) ... [2023-11-19 08:02:55,687 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:02:56,099 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_c966ea4f-81fd-4748-8b2f-18712e1c8542/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-19 08:02:56,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:56,123 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:02:56,209 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_c966ea4f-81fd-4748-8b2f-18712e1c8542/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-19 08:02:56,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:56,253 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:02:56,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56 WrapperNode [2023-11-19 08:02:56,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:56,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:56,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:02:56,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:02:56,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,317 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-11-19 08:02:56,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:56,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:02:56,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:02:56,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:02:56,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:02:56,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:02:56,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:02:56,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:02:56,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (1/1) ... [2023-11-19 08:02:56,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:56,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:56,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:02:56,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:02:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:02:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:02:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 08:02:56,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 08:02:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 08:02:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:02:56,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:02:56,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 08:02:56,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 08:02:56,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:02:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 08:02:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:02:56,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:02:56,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:02:56,663 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:02:56,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:02:56,928 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:02:56,936 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:02:56,937 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 08:02:56,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:56 BoogieIcfgContainer [2023-11-19 08:02:56,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:02:56,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:02:56,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:02:56,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:02:56,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:02:55" (1/3) ... [2023-11-19 08:02:56,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc84bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:56, skipping insertion in model container [2023-11-19 08:02:56,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:56" (2/3) ... [2023-11-19 08:02:56,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc84bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:56, skipping insertion in model container [2023-11-19 08:02:56,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:56" (3/3) ... [2023-11-19 08:02:56,951 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-11-19 08:02:56,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:02:56,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 08:02:57,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:57,032 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;@504916f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:57,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 08:02:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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 08:02:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 08:02:57,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:02:57,045 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 08:02:57,046 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:02:57,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:57,051 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2023-11-19 08:02:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:57,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652595930] [2023-11-19 08:02:57,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:57,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:02:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:57,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 08:02:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:57,535 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 08:02:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652595930] [2023-11-19 08:02:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652595930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:57,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:57,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836042878] [2023-11-19 08:02:57,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:57,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:57,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:57,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:57,594 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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 08:02:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:02:57,716 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2023-11-19 08:02:57,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:57,719 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 08:02:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:02:57,727 INFO L225 Difference]: With dead ends: 65 [2023-11-19 08:02:57,728 INFO L226 Difference]: Without dead ends: 28 [2023-11-19 08:02:57,732 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 08:02:57,739 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:02:57,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:02:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-19 08:02:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-19 08:02:57,792 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 08:02:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-19 08:02:57,797 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-11-19 08:02:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:02:57,801 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-19 08:02:57,802 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 08:02:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-19 08:02:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 08:02:57,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:02:57,805 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 08:02:57,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:02:57,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:02:57,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2023-11-19 08:02:57,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:57,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611425009] [2023-11-19 08:02:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:57,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:02:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 08:02:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:58,252 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 08:02:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:58,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611425009] [2023-11-19 08:02:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611425009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:02:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935756610] [2023-11-19 08:02:58,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:58,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:58,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:58,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:02:58,261 INFO L87 Difference]: Start difference. First operand 28 states and 34 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 08:02:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:02:58,351 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-11-19 08:02:58,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:58,352 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 08:02:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:02:58,355 INFO L225 Difference]: With dead ends: 52 [2023-11-19 08:02:58,355 INFO L226 Difference]: Without dead ends: 31 [2023-11-19 08:02:58,361 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 08:02:58,364 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:02:58,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:02:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-19 08:02:58,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-19 08:02:58,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 08:02:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-19 08:02:58,386 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2023-11-19 08:02:58,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:02:58,387 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-19 08:02:58,387 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 08:02:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-19 08:02:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 08:02:58,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:02:58,391 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] [2023-11-19 08:02:58,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:02:58,392 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:02:58,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2023-11-19 08:02:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:58,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067807598] [2023-11-19 08:02:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:02:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:59,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:02:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 08:02:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:59,315 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 08:02:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:59,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067807598] [2023-11-19 08:02:59,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067807598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:59,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138936474] [2023-11-19 08:02:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:59,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:59,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:59,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:59,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:02:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:59,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-19 08:02:59,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:59,724 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 08:02:59,776 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 08:02:59,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:02:59,810 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 08:02:59,838 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 08:02:59,856 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 08:02:59,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:02:59,922 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int)) (|v_node_create_~temp~0#1.base_7| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_7| v_ArrVal_300) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_7| 1)))) is different from false [2023-11-19 08:02:59,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138936474] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:59,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:02:59,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2023-11-19 08:02:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118368398] [2023-11-19 08:02:59,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:02:59,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 08:02:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 08:02:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=260, Unknown=2, NotChecked=66, Total=380 [2023-11-19 08:02:59,927 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 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 08:03:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:00,289 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-11-19 08:03:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 08:03:00,289 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 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 32 [2023-11-19 08:03:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:00,291 INFO L225 Difference]: With dead ends: 39 [2023-11-19 08:03:00,291 INFO L226 Difference]: Without dead ends: 31 [2023-11-19 08:03:00,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=466, Unknown=2, NotChecked=90, Total=650 [2023-11-19 08:03:00,293 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:00,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 177 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 220 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2023-11-19 08:03:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-19 08:03:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-19 08:03:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 08:03:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-19 08:03:00,301 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2023-11-19 08:03:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:00,302 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-19 08:03:00,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 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 08:03:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-19 08:03:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 08:03:00,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:00,304 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] [2023-11-19 08:03:00,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 08:03:00,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:00,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:00,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2023-11-19 08:03:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:00,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426201923] [2023-11-19 08:03:00,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:00,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:03:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:01,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 08:03:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:02,084 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 08:03:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426201923] [2023-11-19 08:03:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426201923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548305076] [2023-11-19 08:03:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:02,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:02,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:02,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:02,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:03:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:02,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-19 08:03:02,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:02,616 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 08:03:02,880 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 08:03:03,038 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 08:03:03,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-19 08:03:03,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 08:03:03,321 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 08:03:03,628 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 38 treesize of output 22 [2023-11-19 08:03:03,635 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 08:03:03,644 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 08:03:03,652 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 08:03:03,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:03,934 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 08:03:03,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:03,947 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 46 treesize of output 35 [2023-11-19 08:03:03,974 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-19 08:03:03,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-19 08:03:03,987 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 20 treesize of output 15 [2023-11-19 08:03:04,720 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-19 08:03:04,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 74 [2023-11-19 08:03:04,756 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-19 08:03:04,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 106 [2023-11-19 08:03:04,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2023-11-19 08:03:04,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-11-19 08:03:04,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:04,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:04,797 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 45 treesize of output 11 [2023-11-19 08:03:04,907 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 08:03:04,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 28 [2023-11-19 08:03:04,917 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 08:03:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:05,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:06,052 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_486))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_487) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| 1)) (< (select .cse0 .cse1) .cse2) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse2 (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_485) .cse2) .cse1 v_ArrVal_475)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_474) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_470) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_473) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) is different from false [2023-11-19 08:03:06,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548305076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:06,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:03:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 40 [2023-11-19 08:03:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445268265] [2023-11-19 08:03:06,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:06,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-19 08:03:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-19 08:03:06,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2073, Unknown=36, NotChecked=92, Total=2352 [2023-11-19 08:03:06,063 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 40 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 32 states have internal predecessors, (53), 6 states have call successors, (6), 4 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 08:03:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:08,173 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-19 08:03:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 08:03:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 32 states have internal predecessors, (53), 6 states have call successors, (6), 4 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 35 [2023-11-19 08:03:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:08,186 INFO L225 Difference]: With dead ends: 42 [2023-11-19 08:03:08,186 INFO L226 Difference]: Without dead ends: 33 [2023-11-19 08:03:08,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=283, Invalid=3220, Unknown=41, NotChecked=116, Total=3660 [2023-11-19 08:03:08,190 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 65 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:08,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 316 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 08:03:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-19 08:03:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-19 08:03:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 08:03:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-19 08:03:08,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 35 [2023-11-19 08:03:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:08,214 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-19 08:03:08,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 32 states have internal predecessors, (53), 6 states have call successors, (6), 4 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 08:03:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-19 08:03:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 08:03:08,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:08,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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 08:03:08,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:08,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:08,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:08,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2023-11-19 08:03:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755650347] [2023-11-19 08:03:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:10,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:03:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:11,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 08:03:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 08:03:11,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:11,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755650347] [2023-11-19 08:03:11,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755650347] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:11,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041708863] [2023-11-19 08:03:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:11,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:11,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 08:03:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:12,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 149 conjunts are in the unsatisfiable core [2023-11-19 08:03:12,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:12,375 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 08:03:12,619 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 08:03:12,762 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 08:03:12,928 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 08:03:12,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-19 08:03:13,091 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 08:03:13,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 08:03:13,145 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 15 treesize of output 1 [2023-11-19 08:03:13,369 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 08:03:13,379 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 08:03:13,386 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 08:03:13,747 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 08:03:13,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2023-11-19 08:03:13,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:13,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-19 08:03:13,766 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 08:03:13,771 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 08:03:14,096 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-19 08:03:14,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-19 08:03:16,447 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) (and (let ((.cse2 (<= (+ 3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (= (select (select |c_#memory_int| .cse0) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (<= (+ .cse0 3) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse0) 0) 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) .cse2) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (+ .cse4 2))) (and (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= (select (select |c_#memory_int| .cse4) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) 0))) (let ((.cse9 (+ .cse8 1))) (let ((.cse5 (<= .cse9 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse6 (<= .cse9 .cse4))) (or (and (<= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) .cse5) (and .cse5 .cse6) (and (<= .cse7 .cse4) .cse6) (and .cse2 (<= (+ .cse4 3) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse8 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse10) 0) 1)) (.cse12 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (<= (+ .cse10 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse10) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse10) 0) 0) (<= .cse11 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (not (= .cse10 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse12 (select |c_#memory_$Pointer$.base| .cse12))) (<= .cse11 .cse10) (= .cse12 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse13 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse14 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (<= (+ .cse13 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse13) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse13) 0) 0) (<= .cse7 .cse13) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse14 (select |c_#memory_$Pointer$.base| .cse14))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse13) 0) 1) .cse13) (= .cse14 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) .cse2) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse15 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse16 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (= (select (select |c_#memory_int| .cse15) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse15) 0) 0) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse15) 0) 1) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (<= (+ .cse15 2) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse16 (select |c_#memory_$Pointer$.base| .cse16))) (= .cse16 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2023-11-19 08:03:16,453 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) (and (let ((.cse2 (<= (+ 3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse1 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (= (select (select |c_#memory_int| .cse0) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (<= (+ .cse0 3) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse0) 0) 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) .cse2) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (+ .cse4 2))) (and (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= (select (select |c_#memory_int| .cse4) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| .cse4) 0))) (let ((.cse9 (+ .cse8 1))) (let ((.cse5 (<= .cse9 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse6 (<= .cse9 .cse4))) (or (and (<= .cse3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) .cse5) (and .cse5 .cse6) (and (<= .cse7 .cse4) .cse6) (and .cse2 (<= (+ .cse4 3) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse8 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse10) 0) 1)) (.cse12 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (<= (+ .cse10 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse10) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse10) 0) 0) (<= .cse11 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (not (= .cse10 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse12 (select |c_#memory_$Pointer$.base| .cse12))) (<= .cse11 .cse10) (= .cse12 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse13 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse14 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (<= (+ .cse13 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse13) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse13) 0) 0) (<= .cse7 .cse13) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse14 (select |c_#memory_$Pointer$.base| .cse14))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse13) 0) 1) .cse13) (= .cse14 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) .cse2) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse15 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse16 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (= (select (select |c_#memory_int| .cse15) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse15) 0) 0) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse15) 0) 1) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (<= (+ .cse15 2) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse16 (select |c_#memory_$Pointer$.base| .cse16))) (= .cse16 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2023-11-19 08:03:18,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:18,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:18,555 INFO L349 Elim1Store]: treesize reduction 33, result has 36.5 percent of original size [2023-11-19 08:03:18,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 51 [2023-11-19 08:03:18,585 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-11-19 08:03:18,649 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-11-19 08:03:18,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 196 treesize of output 128 [2023-11-19 08:03:18,715 INFO L349 Elim1Store]: treesize reduction 74, result has 21.3 percent of original size [2023-11-19 08:03:18,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 202 [2023-11-19 08:03:18,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:18,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:18,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-19 08:03:18,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2023-11-19 08:03:18,774 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 103 treesize of output 87 [2023-11-19 08:03:19,224 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 08:03:19,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 70 [2023-11-19 08:03:19,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:19,239 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 59 treesize of output 51 [2023-11-19 08:03:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:19,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:21,113 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_666 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_684)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_682))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|)) (.cse5 (select .cse6 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|)) (.cse1 (select (select .cse6 .cse2) .cse4))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| 1)) (not (= (select .cse0 .cse1) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|) 0)) (< (select (select .cse3 .cse2) .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_683) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) .cse1 v_ArrVal_666)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_671) (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store .cse0 .cse1 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_668) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store .cse5 .cse1 v_ArrVal_670)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_665) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse4 (select .cse5 .cse1)))))))) is different from false [2023-11-19 08:03:21,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041708863] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:21,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:03:21,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 44 [2023-11-19 08:03:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043946328] [2023-11-19 08:03:21,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:21,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-19 08:03:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-19 08:03:21,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2336, Unknown=30, NotChecked=198, Total=2756 [2023-11-19 08:03:21,120 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 44 states, 40 states have (on average 1.35) internal successors, (54), 35 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 08:03:24,604 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (= (select (select |c_#memory_int| .cse5) 4) 1)) (.cse20 (select .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse21 (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse5) 0) 0)) (.cse22 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$.base| .cse5) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse3 (<= (+ 3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (= (select (select |c_#memory_int| .cse1) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (<= (+ .cse1 3) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse1) 0) 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) .cse3) (let ((.cse4 (+ .cse5 2))) (and (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse5 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) .cse6 .cse7 (let ((.cse12 (+ .cse11 1))) (let ((.cse8 (<= .cse12 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse9 (<= .cse12 .cse5))) (or (and (<= .cse4 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) .cse8) (and .cse8 .cse9) (and (<= .cse10 .cse5) .cse9) (and .cse3 (<= (+ .cse5 3) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse11 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse13 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse13) 0) 1)) (.cse15 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (<= (+ .cse13 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse13) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse13) 0) 0) (<= .cse14 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (not (= .cse13 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse15 (select |c_#memory_$Pointer$.base| .cse15))) (<= .cse14 .cse13) (= .cse15 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse17 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (<= (+ .cse16 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse16) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse16) 0) 0) (<= .cse10 .cse16) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse17 (select |c_#memory_$Pointer$.base| .cse17))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse16) 0) 1) .cse16) (= .cse17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) .cse3) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse18 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse19 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (= (select (select |c_#memory_int| .cse18) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse18) 0) 0) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse18) 0) 1) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (<= (+ .cse18 2) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse19 (select |c_#memory_$Pointer$.base| .cse19))) (= .cse19 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= (+ .cse5 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| (select (select |c_#memory_$Pointer$.base| .cse20) .cse21))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse22) 4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse5) 1) .cse6 (= (select (select |c_#memory_$Pointer$.offset| .cse20) .cse21) .cse21) (<= (+ |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse7 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (not (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse22)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (<= .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.base| 1) |c_#StackHeapBarrier|) (not (= .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1)))) is different from false [2023-11-19 08:03:24,609 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (= (select (select |c_#memory_int| .cse5) 4) 1)) (.cse20 (select .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse21 (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse5) 0) 0)) (.cse22 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$.base| .cse5) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (let ((.cse3 (<= (+ 3 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (= (select (select |c_#memory_int| .cse1) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (<= (+ .cse1 3) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse1) 0) 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) .cse3) (let ((.cse4 (+ .cse5 2))) (and (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse5 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) .cse6 .cse7 (let ((.cse12 (+ .cse11 1))) (let ((.cse8 (<= .cse12 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse9 (<= .cse12 .cse5))) (or (and (<= .cse4 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) .cse8) (and .cse8 .cse9) (and (<= .cse10 .cse5) .cse9) (and .cse3 (<= (+ .cse5 3) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse11 2) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse13 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse13) 0) 1)) (.cse15 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (<= (+ .cse13 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse13) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse13) 0) 0) (<= .cse14 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (not (= .cse13 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse15 (select |c_#memory_$Pointer$.base| .cse15))) (<= .cse14 .cse13) (= .cse15 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse17 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (<= (+ .cse16 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse16) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse16) 0) 0) (<= .cse10 .cse16) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse17 (select |c_#memory_$Pointer$.base| .cse17))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse16) 0) 1) .cse16) (= .cse17 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))) .cse3) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse18 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse19 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_#memory_$Pointer$.base|))) (and (= (select (select |c_#memory_int| .cse18) 4) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse18) 0) 0) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse18) 0) 1) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (<= (+ .cse18 2) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| .cse19 (select |c_#memory_$Pointer$.base| .cse19))) (= .cse19 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= (+ .cse5 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| (select (select |c_#memory_$Pointer$.base| .cse20) .cse21))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse22) 4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse5) 1) .cse6 (= (select (select |c_#memory_$Pointer$.offset| .cse20) .cse21) .cse21) (<= (+ |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1) |c_#StackHeapBarrier|) (<= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse7 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (not (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse22)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 4) 1) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (<= .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |c_#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.base| 1) |c_#StackHeapBarrier|) (not (= .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1)))) is different from true [2023-11-19 08:03:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:27,756 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2023-11-19 08:03:27,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-19 08:03:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 35 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2023-11-19 08:03:27,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:27,761 INFO L225 Difference]: With dead ends: 87 [2023-11-19 08:03:27,761 INFO L226 Difference]: Without dead ends: 85 [2023-11-19 08:03:27,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=457, Invalid=5527, Unknown=34, NotChecked=462, Total=6480 [2023-11-19 08:03:27,769 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 107 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:27,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 344 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1135 Invalid, 0 Unknown, 140 Unchecked, 1.5s Time] [2023-11-19 08:03:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-19 08:03:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2023-11-19 08:03:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 08:03:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2023-11-19 08:03:27,799 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 37 [2023-11-19 08:03:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:27,802 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2023-11-19 08:03:27,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 35 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 08:03:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2023-11-19 08:03:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-19 08:03:27,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:27,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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 08:03:27,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-19 08:03:28,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:28,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:28,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2023-11-19 08:03:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306065140] [2023-11-19 08:03:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:29,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:03:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:29,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 08:03:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 08:03:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:29,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306065140] [2023-11-19 08:03:29,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306065140] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:29,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579108695] [2023-11-19 08:03:29,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 08:03:29,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:29,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:29,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:29,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 08:03:29,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 08:03:29,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:03:29,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 174 conjunts are in the unsatisfiable core [2023-11-19 08:03:29,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:29,988 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 08:03:30,276 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 08:03:30,366 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 08:03:30,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-19 08:03:30,493 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 08:03:30,506 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 08:03:30,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 08:03:30,681 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-19 08:03:30,683 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 72 treesize of output 46 [2023-11-19 08:03:30,692 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 27 treesize of output 22 [2023-11-19 08:03:30,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-19 08:03:30,991 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-19 08:03:30,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 50 [2023-11-19 08:03:31,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:31,010 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 08:03:31,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-11-19 08:03:31,017 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 08:03:31,021 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 08:03:31,157 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-19 08:03:31,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:31,345 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-19 08:03:31,345 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 5 case distinctions, treesize of input 112 treesize of output 89 [2023-11-19 08:03:31,375 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-19 08:03:31,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-19 08:03:31,392 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 20 treesize of output 15 [2023-11-19 08:03:31,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:31,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:31,409 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-19 08:03:31,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-11-19 08:03:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 08:03:32,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:32,750 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_864 (Array Int Int)) (v_ArrVal_870 Int) (v_ArrVal_869 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_869)))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_870))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-11-19 08:03:33,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:03:33,970 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 675 treesize of output 673 [2023-11-19 08:03:34,036 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_864 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_870 Int) (v_ArrVal_879 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| Int) (v_ArrVal_869 Int) (v_ArrVal_880 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_880)) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_879))) (let ((.cse0 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse7 (select (select .cse9 .cse0) .cse10)) (.cse8 (select (select .cse6 .cse0) .cse10))) (let ((.cse3 (select (select .cse9 .cse7) .cse8))) (let ((.cse1 (select .cse9 .cse3)) (.cse2 (select (select .cse6 .cse7) .cse8))) (or (not (= (select v_arrayElimArr_7 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|) 0)) (not (= .cse0 (select .cse1 .cse2))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_arrayElimArr_7))) (let ((.cse4 (store (select .cse5 .cse3) .cse2 v_ArrVal_869))) (store (store |c_#memory_int| .cse3 .cse4) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| (store (select (store .cse5 .cse3 .cse4) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|) 0 v_ArrVal_870)))) (select (select (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse1 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_865) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select .cse6 .cse3) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_864) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))))) is different from false [2023-11-19 08:03:34,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579108695] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:34,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:03:34,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2023-11-19 08:03:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177707562] [2023-11-19 08:03:34,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:34,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-19 08:03:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:34,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-19 08:03:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2178, Unknown=3, NotChecked=190, Total=2550 [2023-11-19 08:03:34,045 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 40 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 32 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 08:03:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:36,769 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2023-11-19 08:03:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-19 08:03:36,769 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 32 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2023-11-19 08:03:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:03:36,771 INFO L225 Difference]: With dead ends: 71 [2023-11-19 08:03:36,771 INFO L226 Difference]: Without dead ends: 60 [2023-11-19 08:03:36,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=344, Invalid=3321, Unknown=3, NotChecked=238, Total=3906 [2023-11-19 08:03:36,773 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 08:03:36,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 276 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 08:03:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-19 08:03:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-11-19 08:03:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-19 08:03:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2023-11-19 08:03:36,799 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 39 [2023-11-19 08:03:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:03:36,799 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2023-11-19 08:03:36,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 32 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 08:03:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2023-11-19 08:03:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-19 08:03:36,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:03:36,801 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1] [2023-11-19 08:03:36,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:37,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 08:03:37,013 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:03:37,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2023-11-19 08:03:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:37,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631507229] [2023-11-19 08:03:37,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:03:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:03:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 08:03:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 08:03:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631507229] [2023-11-19 08:03:38,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631507229] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45225562] [2023-11-19 08:03:38,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:38,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:38,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:38,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:38,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c966ea4f-81fd-4748-8b2f-18712e1c8542/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 08:03:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-19 08:03:39,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:39,191 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 08:03:39,326 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 08:03:39,519 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 08:03:39,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-19 08:03:39,609 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 08:03:39,727 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 08:03:39,727 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 43 treesize of output 40 [2023-11-19 08:03:39,924 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-19 08:03:39,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 32 [2023-11-19 08:03:39,932 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 08:03:39,939 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 08:03:40,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:40,198 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-19 08:03:40,199 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 60 treesize of output 45 [2023-11-19 08:03:40,219 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-19 08:03:40,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-19 08:03:40,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:40,234 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 16 treesize of output 11 [2023-11-19 08:03:41,117 INFO L349 Elim1Store]: treesize reduction 67, result has 32.3 percent of original size [2023-11-19 08:03:41,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 64 [2023-11-19 08:03:41,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:03:41,203 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2023-11-19 08:03:41,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 55 [2023-11-19 08:03:41,341 INFO L349 Elim1Store]: treesize reduction 168, result has 31.4 percent of original size [2023-11-19 08:03:41,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 88 treesize of output 121 [2023-11-19 08:03:41,475 INFO L349 Elim1Store]: treesize reduction 134, result has 31.6 percent of original size [2023-11-19 08:03:41,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 149 treesize of output 185 [2023-11-19 08:03:41,535 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 08:03:41,724 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 08:03:41,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:03:41,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-11-19 08:03:41,883 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 08:03:42,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:03:42,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-11-19 08:03:42,284 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