./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/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_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:41:35,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:41:35,968 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:41:35,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:41:35,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:41:36,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:41:36,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:41:36,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:41:36,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:41:36,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:41:36,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:41:36,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:41:36,031 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:41:36,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:41:36,033 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:41:36,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:41:36,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:41:36,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:41:36,035 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:41:36,035 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:41:36,036 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:41:36,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:41:36,037 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:41:36,037 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:41:36,038 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:41:36,038 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:41:36,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:41:36,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:41:36,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:41:36,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:36,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:41:36,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:41:36,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:41:36,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:41:36,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:41:36,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:41:36,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:41:36,044 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:41:36,044 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_cc03334d-93d3-4d29-a096-d53e1b88057a/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_cc03334d-93d3-4d29-a096-d53e1b88057a/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2023-11-19 07:41:36,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:41:36,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:41:36,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:41:36,348 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:41:36,349 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:41:36,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2023-11-19 07:41:39,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:41:39,915 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:41:39,916 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2023-11-19 07:41:39,936 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/data/aaa087b28/2a94b8c1f5c24c658beeb521bac2ef3d/FLAG6e1629678 [2023-11-19 07:41:39,962 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/data/aaa087b28/2a94b8c1f5c24c658beeb521bac2ef3d [2023-11-19 07:41:39,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:41:39,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:41:39,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:39,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:41:39,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:41:39,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:39" (1/1) ... [2023-11-19 07:41:39,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a685af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:39, skipping insertion in model container [2023-11-19 07:41:39,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:39" (1/1) ... [2023-11-19 07:41:40,052 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:41:40,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:40,477 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:41:40,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:40,587 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:41:40,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40 WrapperNode [2023-11-19 07:41:40,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:40,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:40,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:41:40,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:41:40,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,636 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-11-19 07:41:40,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:40,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:41:40,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:41:40,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:41:40,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:41:40,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:41:40,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:41:40,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:41:40,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (1/1) ... [2023-11-19 07:41:40,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:40,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:40,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:41:40,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:41:40,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:41:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 07:41:40,760 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 07:41:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:41:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:41:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:41:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:41:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:41:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:41:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 07:41:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:41:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:41:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:41:40,915 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:41:40,935 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:41:41,369 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:41:41,381 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:41:41,382 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 07:41:41,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:41 BoogieIcfgContainer [2023-11-19 07:41:41,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:41:41,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:41:41,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:41:41,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:41:41,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:41:39" (1/3) ... [2023-11-19 07:41:41,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d043e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:41, skipping insertion in model container [2023-11-19 07:41:41,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:40" (2/3) ... [2023-11-19 07:41:41,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d043e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:41, skipping insertion in model container [2023-11-19 07:41:41,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:41" (3/3) ... [2023-11-19 07:41:41,397 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2023-11-19 07:41:41,418 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:41:41,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-19 07:41:41,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:41:41,476 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@664d26f7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:41:41,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2023-11-19 07:41:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 51 states have (on average 2.019607843137255) internal successors, (103), 93 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 07:41:41,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:41,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:41:41,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:41,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:41,497 INFO L85 PathProgramCache]: Analyzing trace with hash 894013205, now seen corresponding path program 1 times [2023-11-19 07:41:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:41,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343904387] [2023-11-19 07:41:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:41,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:41:41,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:41,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343904387] [2023-11-19 07:41:41,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343904387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:41,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:41,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:41:41,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43270646] [2023-11-19 07:41:41,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:41,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:41:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:41:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:41,877 INFO L87 Difference]: Start difference. First operand has 97 states, 51 states have (on average 2.019607843137255) internal successors, (103), 93 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:41,988 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-11-19 07:41:41,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:41:41,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 07:41:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:42,000 INFO L225 Difference]: With dead ends: 94 [2023-11-19 07:41:42,000 INFO L226 Difference]: Without dead ends: 91 [2023-11-19 07:41:42,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:42,006 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:42,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 140 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:42,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-19 07:41:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-19 07:41:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2023-11-19 07:41:42,049 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 6 [2023-11-19 07:41:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:42,050 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2023-11-19 07:41:42,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2023-11-19 07:41:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 07:41:42,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:42,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:41:42,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:41:42,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:42,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 894013206, now seen corresponding path program 1 times [2023-11-19 07:41:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:42,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443420110] [2023-11-19 07:41:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:42,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:41:42,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:42,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443420110] [2023-11-19 07:41:42,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443420110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:42,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:42,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:41:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419651022] [2023-11-19 07:41:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:42,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:41:42,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:42,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:41:42,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:42,273 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:42,366 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2023-11-19 07:41:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:41:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 07:41:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:42,368 INFO L225 Difference]: With dead ends: 89 [2023-11-19 07:41:42,369 INFO L226 Difference]: Without dead ends: 89 [2023-11-19 07:41:42,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:42,371 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:42,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-19 07:41:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-19 07:41:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2023-11-19 07:41:42,383 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 6 [2023-11-19 07:41:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:42,383 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2023-11-19 07:41:42,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:41:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2023-11-19 07:41:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 07:41:42,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:42,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:42,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:41:42,387 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:42,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:42,390 INFO L85 PathProgramCache]: Analyzing trace with hash 240538839, now seen corresponding path program 1 times [2023-11-19 07:41:42,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:42,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679917733] [2023-11-19 07:41:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:42,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:41:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:42,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679917733] [2023-11-19 07:41:42,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679917733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:42,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:42,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902475649] [2023-11-19 07:41:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:42,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:42,654 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:41:42,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:42,819 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2023-11-19 07:41:42,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:42,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-11-19 07:41:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:42,827 INFO L225 Difference]: With dead ends: 96 [2023-11-19 07:41:42,828 INFO L226 Difference]: Without dead ends: 96 [2023-11-19 07:41:42,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:42,836 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:42,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 207 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-19 07:41:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2023-11-19 07:41:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.836734693877551) internal successors, (90), 86 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-11-19 07:41:42,864 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 13 [2023-11-19 07:41:42,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:42,870 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-11-19 07:41:42,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:41:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-11-19 07:41:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 07:41:42,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:42,872 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:42,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:41:42,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:42,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash 564137500, now seen corresponding path program 1 times [2023-11-19 07:41:42,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:42,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184260256] [2023-11-19 07:41:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:42,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:41:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184260256] [2023-11-19 07:41:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184260256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:43,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:41:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326598884] [2023-11-19 07:41:43,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:43,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:41:43,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:41:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:41:43,194 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:43,448 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2023-11-19 07:41:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:41:43,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-11-19 07:41:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:43,451 INFO L225 Difference]: With dead ends: 89 [2023-11-19 07:41:43,451 INFO L226 Difference]: Without dead ends: 89 [2023-11-19 07:41:43,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:43,464 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 5 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:43,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 287 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:41:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-19 07:41:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-19 07:41:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 49 states have (on average 1.816326530612245) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2023-11-19 07:41:43,482 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 22 [2023-11-19 07:41:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:43,483 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2023-11-19 07:41:43,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2023-11-19 07:41:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 07:41:43,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:43,485 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:43,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:41:43,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:43,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash 564137501, now seen corresponding path program 1 times [2023-11-19 07:41:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:43,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906040444] [2023-11-19 07:41:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:43,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:41:43,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906040444] [2023-11-19 07:41:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906040444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:43,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:41:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561588124] [2023-11-19 07:41:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:43,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:41:43,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:41:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:41:43,931 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:44,184 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2023-11-19 07:41:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:41:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-11-19 07:41:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:44,186 INFO L225 Difference]: With dead ends: 88 [2023-11-19 07:41:44,186 INFO L226 Difference]: Without dead ends: 88 [2023-11-19 07:41:44,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:44,187 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 3 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:44,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 311 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:41:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-19 07:41:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-19 07:41:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2023-11-19 07:41:44,204 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 22 [2023-11-19 07:41:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:44,205 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2023-11-19 07:41:44,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2023-11-19 07:41:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 07:41:44,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:44,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:44,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:41:44,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:44,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash 13222085, now seen corresponding path program 1 times [2023-11-19 07:41:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151811934] [2023-11-19 07:41:44,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:41:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151811934] [2023-11-19 07:41:44,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151811934] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:44,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971190124] [2023-11-19 07:41:44,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:44,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:44,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:44,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:44,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:41:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-19 07:41:44,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:44,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 07:41:45,017 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:41:45,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-19 07:41:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:41:45,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:41:45,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971190124] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:41:45,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:41:45,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-11-19 07:41:45,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309524334] [2023-11-19 07:41:45,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:45,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 07:41:45,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:45,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 07:41:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-19 07:41:45,607 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-19 07:41:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:45,960 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2023-11-19 07:41:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:41:45,960 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-11-19 07:41:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:45,962 INFO L225 Difference]: With dead ends: 87 [2023-11-19 07:41:45,962 INFO L226 Difference]: Without dead ends: 87 [2023-11-19 07:41:45,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:41:45,964 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 12 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:45,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 412 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-19 07:41:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-19 07:41:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2023-11-19 07:41:45,987 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 25 [2023-11-19 07:41:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:45,988 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2023-11-19 07:41:45,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-19 07:41:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2023-11-19 07:41:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 07:41:45,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:45,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:46,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 07:41:46,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:46,210 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:46,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:46,210 INFO L85 PathProgramCache]: Analyzing trace with hash 13222086, now seen corresponding path program 1 times [2023-11-19 07:41:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:46,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42508090] [2023-11-19 07:41:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:46,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:46,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:41:46,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42508090] [2023-11-19 07:41:46,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42508090] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118030579] [2023-11-19 07:41:46,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:46,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:46,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:46,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:41:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:46,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-19 07:41:46,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:46,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 07:41:46,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:41:47,143 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:41:47,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 07:41:47,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 07:41:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:41:47,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118030579] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:47,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:41:47,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-19 07:41:47,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65297267] [2023-11-19 07:41:47,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:47,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 07:41:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 07:41:47,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2023-11-19 07:41:47,404 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:41:47,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:47,988 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2023-11-19 07:41:47,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:41:47,989 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-11-19 07:41:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:47,990 INFO L225 Difference]: With dead ends: 88 [2023-11-19 07:41:47,990 INFO L226 Difference]: Without dead ends: 88 [2023-11-19 07:41:47,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2023-11-19 07:41:47,991 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 13 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:47,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 575 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:41:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-19 07:41:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2023-11-19 07:41:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2023-11-19 07:41:47,997 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 25 [2023-11-19 07:41:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:47,997 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2023-11-19 07:41:47,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:41:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2023-11-19 07:41:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 07:41:47,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:47,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:48,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:41:48,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:48,218 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:48,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:48,218 INFO L85 PathProgramCache]: Analyzing trace with hash 281017908, now seen corresponding path program 1 times [2023-11-19 07:41:48,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:48,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652573984] [2023-11-19 07:41:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:48,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:41:48,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:48,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652573984] [2023-11-19 07:41:48,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652573984] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:48,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831992599] [2023-11-19 07:41:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:48,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:48,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:48,424 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:48,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:41:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:41:48,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 07:41:48,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:41:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831992599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:48,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:41:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-19 07:41:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553928140] [2023-11-19 07:41:48,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:48,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:48,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:48,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:41:48,605 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:48,622 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2023-11-19 07:41:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-11-19 07:41:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:48,624 INFO L225 Difference]: With dead ends: 142 [2023-11-19 07:41:48,624 INFO L226 Difference]: Without dead ends: 142 [2023-11-19 07:41:48,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:41:48,626 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 183 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:48,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 168 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:41:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-19 07:41:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2023-11-19 07:41:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.74) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2023-11-19 07:41:48,632 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 29 [2023-11-19 07:41:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:48,632 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2023-11-19 07:41:48,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2023-11-19 07:41:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 07:41:48,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:48,634 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:48,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-19 07:41:48,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:48,854 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:48,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash 281017896, now seen corresponding path program 1 times [2023-11-19 07:41:48,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:48,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116934223] [2023-11-19 07:41:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:48,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 07:41:49,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:49,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116934223] [2023-11-19 07:41:49,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116934223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:49,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:49,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:41:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839010381] [2023-11-19 07:41:49,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:49,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:41:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:49,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:41:49,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:41:49,309 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:49,527 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2023-11-19 07:41:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:41:49,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-11-19 07:41:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:49,529 INFO L225 Difference]: With dead ends: 123 [2023-11-19 07:41:49,530 INFO L226 Difference]: Without dead ends: 123 [2023-11-19 07:41:49,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:49,532 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 129 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:49,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 123 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:41:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-19 07:41:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 83. [2023-11-19 07:41:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 79 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-11-19 07:41:49,543 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 29 [2023-11-19 07:41:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:49,544 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-11-19 07:41:49,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-11-19 07:41:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 07:41:49,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:49,546 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:49,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:41:49,547 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:49,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:49,547 INFO L85 PathProgramCache]: Analyzing trace with hash 281017897, now seen corresponding path program 1 times [2023-11-19 07:41:49,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:49,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367874616] [2023-11-19 07:41:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:41:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367874616] [2023-11-19 07:41:50,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367874616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:50,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791069078] [2023-11-19 07:41:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:50,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:50,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:50,214 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:50,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:41:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:50,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-19 07:41:50,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:50,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:41:50,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 07:41:50,471 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|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-19 07:41:50,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:50,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 07:41:50,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 07:41:50,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:50,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 07:41:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:41:50,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:50,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791069078] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:50,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:41:50,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2023-11-19 07:41:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815046566] [2023-11-19 07:41:50,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:50,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:41:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:41:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=187, Unknown=1, NotChecked=28, Total=272 [2023-11-19 07:41:50,939 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:41:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:51,256 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2023-11-19 07:41:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:41:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-11-19 07:41:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:51,258 INFO L225 Difference]: With dead ends: 74 [2023-11-19 07:41:51,258 INFO L226 Difference]: Without dead ends: 74 [2023-11-19 07:41:51,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=208, Unknown=1, NotChecked=30, Total=306 [2023-11-19 07:41:51,259 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 108 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:51,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 160 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 0 Unknown, 69 Unchecked, 0.3s Time] [2023-11-19 07:41:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-19 07:41:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-19 07:41:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2023-11-19 07:41:51,264 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 29 [2023-11-19 07:41:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:51,264 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2023-11-19 07:41:51,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:41:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2023-11-19 07:41:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 07:41:51,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:51,268 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:51,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:41:51,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-19 07:41:51,489 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:51,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash 121620195, now seen corresponding path program 1 times [2023-11-19 07:41:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:51,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661661328] [2023-11-19 07:41:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:41:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661661328] [2023-11-19 07:41:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661661328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:51,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-19 07:41:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658604941] [2023-11-19 07:41:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:51,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:41:51,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:51,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:41:51,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:41:51,807 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:52,212 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-11-19 07:41:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 07:41:52,213 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-19 07:41:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:52,215 INFO L225 Difference]: With dead ends: 108 [2023-11-19 07:41:52,215 INFO L226 Difference]: Without dead ends: 108 [2023-11-19 07:41:52,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:41:52,216 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 98 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:52,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 359 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-19 07:41:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2023-11-19 07:41:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 71 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2023-11-19 07:41:52,220 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 30 [2023-11-19 07:41:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:52,221 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2023-11-19 07:41:52,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2023-11-19 07:41:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 07:41:52,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:52,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:52,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:41:52,223 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:52,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:52,224 INFO L85 PathProgramCache]: Analyzing trace with hash 121620196, now seen corresponding path program 1 times [2023-11-19 07:41:52,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:52,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473886993] [2023-11-19 07:41:52,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:52,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:41:52,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473886993] [2023-11-19 07:41:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473886993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:52,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:52,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-19 07:41:52,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520392374] [2023-11-19 07:41:52,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:52,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:41:52,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:52,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:41:52,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:41:52,713 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:53,195 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2023-11-19 07:41:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:41:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-19 07:41:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:53,197 INFO L225 Difference]: With dead ends: 102 [2023-11-19 07:41:53,197 INFO L226 Difference]: Without dead ends: 102 [2023-11-19 07:41:53,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:41:53,198 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 148 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:53,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 406 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-19 07:41:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2023-11-19 07:41:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2023-11-19 07:41:53,202 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 30 [2023-11-19 07:41:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:53,203 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2023-11-19 07:41:53,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2023-11-19 07:41:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 07:41:53,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:53,204 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 07:41:53,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:41:53,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:53,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash 198473554, now seen corresponding path program 1 times [2023-11-19 07:41:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487380052] [2023-11-19 07:41:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:41:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:53,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487380052] [2023-11-19 07:41:53,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487380052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:53,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:53,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-19 07:41:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791868212] [2023-11-19 07:41:53,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:53,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:41:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:53,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:41:53,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:41:53,478 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:53,860 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2023-11-19 07:41:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 07:41:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-11-19 07:41:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:53,862 INFO L225 Difference]: With dead ends: 119 [2023-11-19 07:41:53,862 INFO L226 Difference]: Without dead ends: 119 [2023-11-19 07:41:53,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:41:53,864 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 174 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:53,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 472 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-19 07:41:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 87. [2023-11-19 07:41:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.484375) internal successors, (95), 83 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-11-19 07:41:53,868 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 35 [2023-11-19 07:41:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:53,869 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-11-19 07:41:53,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-11-19 07:41:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 07:41:53,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:53,870 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2023-11-19 07:41:53,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:41:53,871 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:53,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1858143914, now seen corresponding path program 1 times [2023-11-19 07:41:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:53,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348227756] [2023-11-19 07:41:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:53,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 07:41:54,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:54,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348227756] [2023-11-19 07:41:54,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348227756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:54,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:54,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:41:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662883474] [2023-11-19 07:41:54,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:54,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:41:54,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:54,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:41:54,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:41:54,047 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:54,236 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2023-11-19 07:41:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:41:54,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-19 07:41:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:54,238 INFO L225 Difference]: With dead ends: 87 [2023-11-19 07:41:54,238 INFO L226 Difference]: Without dead ends: 87 [2023-11-19 07:41:54,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:41:54,239 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 39 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:54,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 205 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:41:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-19 07:41:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2023-11-19 07:41:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 82 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2023-11-19 07:41:54,244 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 36 [2023-11-19 07:41:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:54,245 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2023-11-19 07:41:54,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2023-11-19 07:41:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 07:41:54,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:54,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2023-11-19 07:41:54,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:41:54,247 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:54,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1858143915, now seen corresponding path program 1 times [2023-11-19 07:41:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:54,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998616655] [2023-11-19 07:41:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:41:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998616655] [2023-11-19 07:41:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998616655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-19 07:41:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330725576] [2023-11-19 07:41:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:54,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:41:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:54,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:41:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:41:54,904 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:55,534 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2023-11-19 07:41:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:41:55,534 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-19 07:41:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:55,535 INFO L225 Difference]: With dead ends: 126 [2023-11-19 07:41:55,536 INFO L226 Difference]: Without dead ends: 126 [2023-11-19 07:41:55,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2023-11-19 07:41:55,537 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 176 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:55,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 452 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:41:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-19 07:41:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 96. [2023-11-19 07:41:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 92 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2023-11-19 07:41:55,544 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 36 [2023-11-19 07:41:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:55,544 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2023-11-19 07:41:55,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2023-11-19 07:41:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 07:41:55,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:55,546 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2023-11-19 07:41:55,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:41:55,547 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:55,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1857712965, now seen corresponding path program 1 times [2023-11-19 07:41:55,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:55,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659173892] [2023-11-19 07:41:55,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:41:55,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659173892] [2023-11-19 07:41:55,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659173892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:55,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:55,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-19 07:41:55,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116987290] [2023-11-19 07:41:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:55,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:41:55,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:41:55,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:41:55,923 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:56,357 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2023-11-19 07:41:56,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:41:56,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-19 07:41:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:56,359 INFO L225 Difference]: With dead ends: 117 [2023-11-19 07:41:56,359 INFO L226 Difference]: Without dead ends: 117 [2023-11-19 07:41:56,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2023-11-19 07:41:56,360 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 133 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:56,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 390 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-19 07:41:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2023-11-19 07:41:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 95 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2023-11-19 07:41:56,364 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 36 [2023-11-19 07:41:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:56,364 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2023-11-19 07:41:56,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2023-11-19 07:41:56,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 07:41:56,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:56,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2023-11-19 07:41:56,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:41:56,369 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:56,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1754527156, now seen corresponding path program 1 times [2023-11-19 07:41:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306599942] [2023-11-19 07:41:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:56,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:56,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 07:41:56,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:56,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306599942] [2023-11-19 07:41:56,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306599942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912334946] [2023-11-19 07:41:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:56,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:41:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:41:56,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:41:56,492 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:56,628 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2023-11-19 07:41:56,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:41:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2023-11-19 07:41:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:56,630 INFO L225 Difference]: With dead ends: 98 [2023-11-19 07:41:56,630 INFO L226 Difference]: Without dead ends: 98 [2023-11-19 07:41:56,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:56,631 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 23 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:56,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 187 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:56,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-19 07:41:56,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-19 07:41:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 94 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2023-11-19 07:41:56,636 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 37 [2023-11-19 07:41:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:56,636 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2023-11-19 07:41:56,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2023-11-19 07:41:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-19 07:41:56,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:56,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 07:41:56,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:41:56,638 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:56,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1444232920, now seen corresponding path program 1 times [2023-11-19 07:41:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111918184] [2023-11-19 07:41:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:41:57,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111918184] [2023-11-19 07:41:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111918184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853293572] [2023-11-19 07:41:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:57,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:57,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 07:41:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:57,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-19 07:41:57,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:57,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:41:57,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 07:41:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 07:41:57,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:41:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853293572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:57,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:41:57,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2023-11-19 07:41:57,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440090126] [2023-11-19 07:41:57,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:57,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:41:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:41:57,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2023-11-19 07:41:57,365 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:57,531 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2023-11-19 07:41:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:57,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2023-11-19 07:41:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:57,533 INFO L225 Difference]: With dead ends: 97 [2023-11-19 07:41:57,533 INFO L226 Difference]: Without dead ends: 97 [2023-11-19 07:41:57,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:41:57,534 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 78 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:57,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 134 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-19 07:41:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-19 07:41:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.358974358974359) internal successors, (106), 93 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2023-11-19 07:41:57,539 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 38 [2023-11-19 07:41:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:57,540 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2023-11-19 07:41:57,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2023-11-19 07:41:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-19 07:41:57,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:57,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-19 07:41:57,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-19 07:41:57,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-19 07:41:57,762 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:57,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash 61532336, now seen corresponding path program 1 times [2023-11-19 07:41:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170323205] [2023-11-19 07:41:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:57,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 07:41:58,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:58,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170323205] [2023-11-19 07:41:58,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170323205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:58,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:58,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 07:41:58,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608698824] [2023-11-19 07:41:58,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:58,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:41:58,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:58,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:41:58,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:41:58,245 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:58,685 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-11-19 07:41:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:41:58,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2023-11-19 07:41:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:58,687 INFO L225 Difference]: With dead ends: 102 [2023-11-19 07:41:58,687 INFO L226 Difference]: Without dead ends: 102 [2023-11-19 07:41:58,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-11-19 07:41:58,688 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 52 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:58,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 409 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-19 07:41:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2023-11-19 07:41:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 94 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:41:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2023-11-19 07:41:58,692 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 41 [2023-11-19 07:41:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:58,692 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2023-11-19 07:41:58,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 07:41:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2023-11-19 07:41:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-19 07:41:58,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:58,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-19 07:41:58,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:41:58,696 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:41:58,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash 61584951, now seen corresponding path program 1 times [2023-11-19 07:41:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:58,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835092914] [2023-11-19 07:41:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:41:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:41:59,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:59,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835092914] [2023-11-19 07:41:59,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835092914] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:59,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020805736] [2023-11-19 07:41:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:59,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:59,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:59,663 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:59,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 07:42:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:00,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-19 07:42:00,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:42:00,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 07:42:00,404 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:42:00,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 07:42:00,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:42:00,631 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 07:42:00,631 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 34 treesize of output 33 [2023-11-19 07:42:00,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 07:42:01,158 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:42:01,159 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 41 treesize of output 20 [2023-11-19 07:42:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:01,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:42:01,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-11-19 07:42:01,395 INFO L349 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2023-11-19 07:42:01,396 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 26 treesize of output 25 [2023-11-19 07:42:01,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1463 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1463))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse0 .cse1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)))))) is different from false [2023-11-19 07:42:01,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:01,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2023-11-19 07:42:01,654 INFO L349 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2023-11-19 07:42:01,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 120 [2023-11-19 07:42:01,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:01,678 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 93 treesize of output 87 [2023-11-19 07:42:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020805736] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:42:02,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:42:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2023-11-19 07:42:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607317918] [2023-11-19 07:42:02,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:42:02,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-19 07:42:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:02,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-19 07:42:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1749, Unknown=25, NotChecked=84, Total=1980 [2023-11-19 07:42:02,167 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 40 states, 38 states have (on average 1.868421052631579) internal successors, (71), 34 states have internal predecessors, (71), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:42:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:03,891 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2023-11-19 07:42:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-19 07:42:03,892 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.868421052631579) internal successors, (71), 34 states have internal predecessors, (71), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2023-11-19 07:42:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:03,893 INFO L225 Difference]: With dead ends: 136 [2023-11-19 07:42:03,893 INFO L226 Difference]: Without dead ends: 136 [2023-11-19 07:42:03,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=283, Invalid=3000, Unknown=27, NotChecked=112, Total=3422 [2023-11-19 07:42:03,896 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 265 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:03,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 744 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:42:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-19 07:42:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2023-11-19 07:42:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.3) internal successors, (130), 115 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:42:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2023-11-19 07:42:03,909 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 41 [2023-11-19 07:42:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:03,910 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2023-11-19 07:42:03,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.868421052631579) internal successors, (71), 34 states have internal predecessors, (71), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:42:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2023-11-19 07:42:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-19 07:42:03,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:03,912 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-19 07:42:03,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 07:42:04,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:42:04,126 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 07:42:04,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 61584952, now seen corresponding path program 1 times [2023-11-19 07:42:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:04,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055033307] [2023-11-19 07:42:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:42:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:42:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:42:05,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:05,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055033307] [2023-11-19 07:42:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055033307] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:42:05,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186312821] [2023-11-19 07:42:05,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:05,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:42:05,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:42:05,630 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:42:05,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc03334d-93d3-4d29-a096-d53e1b88057a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-19 07:42:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:05,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-19 07:42:05,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:42:05,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 07:42:06,357 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:42:06,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 07:42:06,533 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 07:42:06,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:42:06,773 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 07:42:06,774 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 56 treesize of output 51 [2023-11-19 07:42:06,782 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 39 treesize of output 24 [2023-11-19 07:42:07,825 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:42:07,826 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 73 treesize of output 40 [2023-11-19 07:42:07,847 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 33 treesize of output 17 [2023-11-19 07:42:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:08,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:42:08,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:08,816 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 130 treesize of output 134 [2023-11-19 07:42:08,968 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1583 (Array Int Int)) (v_ArrVal_1582 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1582) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1)) (< (select (select .cse2 .cse0) .cse1) (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 1)))))) (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse3)) (not (= .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (< 0 (+ (select (select .cse5 .cse3) .cse4) 1)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1583 (Array Int Int)) (v_ArrVal_1582 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1582))) (let ((.cse7 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse6 .cse7) .cse8) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse8))))))) is different from false [2023-11-19 07:42:09,072 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1583 (Array Int Int)) (v_ArrVal_1582 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1582))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select (select .cse1 .cse2) .cse0) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1583 (Array Int Int)) (v_ArrVal_1582 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1582) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (< (select (select .cse5 .cse4) .cse3) (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 1)))))) (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse8 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse7)) (< 0 (+ (select (select .cse8 .cse7) .cse6) 1))))))) is different from false [2023-11-19 07:42:09,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:09,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2023-11-19 07:42:09,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:09,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 117 [2023-11-19 07:42:09,143 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 60 treesize of output 56 [2023-11-19 07:42:09,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:09,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2023-11-19 07:42:09,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:09,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 117 [2023-11-19 07:42:09,441 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 60 treesize of output 56 [2023-11-19 07:42:09,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:09,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 52 [2023-11-19 07:42:09,804 INFO L349 Elim1Store]: treesize reduction 21, result has 77.7 percent of original size [2023-11-19 07:42:09,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 176 [2023-11-19 07:42:09,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:09,829 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 134 treesize of output 130 [2023-11-19 07:42:10,325 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 12 treesize of output 8 [2023-11-19 07:42:10,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-19 07:42:10,385 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 12 treesize of output 8 [2023-11-19 07:42:10,408 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 12 treesize of output 8 [2023-11-19 07:42:12,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 1)) (.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (let ((.cse2 (forall ((v_arrayElimCell_39 Int) (v_ArrVal_1583 (Array Int Int))) (let ((.cse35 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583)) (.cse34 (select v_ArrVal_1583 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse34)) (< (select (select .cse35 v_arrayElimCell_39) .cse34) .cse14) (< (select (select .cse35 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse34) .cse14))))) (.cse16 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (.cse0 (and (forall ((v_prenex_2 Int)) (or (forall ((v_arrayElimCell_37 Int) (v_prenex_3 (Array Int Int))) (let ((.cse30 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3))) (let ((.cse31 (select (select .cse30 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse30 v_arrayElimCell_37) .cse31) 1)) (< 0 (+ (select (select .cse30 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse31) 1)) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse31)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_2 Int)) (or (forall ((v_prenex_3 (Array Int Int))) (let ((.cse32 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3))) (let ((.cse33 (select (select .cse32 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse32 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse33) 1)) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse33)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_2))))) (.cse9 (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1583 (Array Int Int))) (let ((.cse27 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583))) (let ((.cse26 (select (select .cse27 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse26 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (select (select .cse27 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse26) .cse14))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_40 Int) (v_ArrVal_1583 (Array Int Int))) (let ((.cse29 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583))) (let ((.cse28 (select (select .cse29 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse28 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (select (select .cse29 v_arrayElimCell_40) .cse28) .cse14) (< (select (select .cse29 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse28) .cse14))))))))) (.cse10 (forall ((v_arrayElimCell_35 Int) (v_prenex_3 (Array Int Int))) (let ((.cse24 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3)) (.cse25 (select v_prenex_3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse24 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse25) 1)) (< 0 (+ (select (select .cse24 v_arrayElimCell_35) .cse25) 1)) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse25)))))) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (and (or .cse0 .cse1) (or .cse2 .cse3) (forall ((v_prenex_3 (Array Int Int))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3)) (.cse5 (select v_prenex_3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse5) 1)) (< 0 (+ (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5) 1)) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse5))))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_prenex_2) (forall ((v_prenex_3 (Array Int Int))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3))) (let ((.cse8 (select (select .cse7 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse7 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse8) 1)) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse8)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_2))) (or .cse9 .cse10) (or .cse1 .cse11) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_40 Int) (v_ArrVal_1583 (Array Int Int))) (let ((.cse13 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583))) (let ((.cse12 (select (select .cse13 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse12 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (select (select .cse13 v_arrayElimCell_40) .cse12) .cse14) (< (select (select .cse13 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse12) .cse14))))))) (or .cse9 .cse2) (forall ((v_prenex_3 (Array Int Int))) (let ((.cse15 (select v_prenex_3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse15) 1)) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse15))))) (or .cse3 .cse16) (or (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1583 (Array Int Int))) (not (= (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|))))) .cse1) (or (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1583 (Array Int Int))) (not (= (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|))))) .cse16) (or (forall ((v_ArrVal_1583 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)))) .cse1) (forall ((v_ArrVal_1583 (Array Int Int))) (let ((.cse18 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583)) (.cse17 (select v_ArrVal_1583 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse17)) (< (select (select .cse18 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse17) .cse14) (< (select (select .cse18 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse17) .cse14)))) (or .cse9 .cse0) (or .cse9 (not .cse3)) (forall ((v_prenex_2 Int)) (or (forall ((v_arrayElimCell_37 Int) (v_prenex_3 (Array Int Int))) (let ((.cse19 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3))) (let ((.cse20 (select (select .cse19 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse19 v_arrayElimCell_37) .cse20) 1)) (< 0 (+ (select (select .cse19 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse20) 1)) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse20)))))) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_prenex_2) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1583 (Array Int Int))) (let ((.cse22 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583))) (let ((.cse21 (select (select .cse22 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse21 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|)) (< (select (select .cse22 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse21) .cse14))))))) (or .cse9 .cse11) (forall ((v_ArrVal_1583 (Array Int Int))) (let ((.cse23 (select v_ArrVal_1583 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| .cse23)) (< (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1583) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) .cse23) .cse14)))) (or .cse10 .cse3)))) is different from false [2023-11-19 07:42:12,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:12,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1114 treesize of output 747 [2023-11-19 07:42:25,500 WARN L293 SmtUtils]: Spent 12.78s on a formula simplification that was a NOOP. DAG size: 1462 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-19 07:42:25,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:42:25,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 27 select indices, 27 select index equivalence classes, 0 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 351 case distinctions, treesize of input 1358 treesize of output 4514