./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:41:23,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:41:23,890 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:41:23,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:41:23,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:41:23,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:41:23,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:41:23,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:41:23,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:41:23,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:41:23,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:41:23,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:41:23,957 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:41:23,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:41:23,960 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:41:23,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:41:23,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:41:23,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:41:23,962 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:41:23,962 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:41:23,962 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:41:23,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:41:23,964 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:41:23,964 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:41:23,964 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:41:23,983 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:41:23,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:41:23,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:41:23,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:41:23,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:41:23,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:41:23,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:41:23,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:41:23,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:41:23,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:41:23,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:41:23,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:41:23,990 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:41:23,991 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_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/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_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2023-11-06 22:41:24,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:41:24,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:41:24,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:41:24,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:41:24,300 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:41:24,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-11-06 22:41:27,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:41:27,730 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:41:27,730 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-11-06 22:41:27,746 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/data/cbf8493c3/16d1a83b05e745e1aee890a41ac2a2d2/FLAG719ece35c [2023-11-06 22:41:27,762 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/data/cbf8493c3/16d1a83b05e745e1aee890a41ac2a2d2 [2023-11-06 22:41:27,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:41:27,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:41:27,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:27,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:41:27,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:41:27,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:27" (1/1) ... [2023-11-06 22:41:27,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2706945d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:27, skipping insertion in model container [2023-11-06 22:41:27,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:27" (1/1) ... [2023-11-06 22:41:27,828 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:41:28,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:28,171 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:41:28,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:28,302 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:41:28,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28 WrapperNode [2023-11-06 22:41:28,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:28,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:28,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:41:28,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:41:28,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,391 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2023-11-06 22:41:28,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:28,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:41:28,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:41:28,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:41:28,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:41:28,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:41:28,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:41:28,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:41:28,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:41:28,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:28,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:28,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:41:28,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:41:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:41:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 22:41:28,527 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 22:41:28,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:41:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:41:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:41:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:41:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:41:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:41:28,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:41:28,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:41:28,652 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:41:28,654 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:41:29,094 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:41:29,103 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:41:29,103 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 22:41:29,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:29 BoogieIcfgContainer [2023-11-06 22:41:29,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:41:29,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:41:29,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:41:29,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:41:29,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:41:27" (1/3) ... [2023-11-06 22:41:29,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187be255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:41:29, skipping insertion in model container [2023-11-06 22:41:29,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (2/3) ... [2023-11-06 22:41:29,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187be255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:41:29, skipping insertion in model container [2023-11-06 22:41:29,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:29" (3/3) ... [2023-11-06 22:41:29,120 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2023-11-06 22:41:29,144 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:41:29,144 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-11-06 22:41:29,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:41:29,197 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;@7d4cde97, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:41:29,197 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-11-06 22:41:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 82 states have internal predecessors, (98), 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-06 22:41:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:41:29,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:29,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,210 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:29,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash 894752021, now seen corresponding path program 1 times [2023-11-06 22:41:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709512243] [2023-11-06 22:41:29,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:29,464 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-06 22:41:29,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:29,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709512243] [2023-11-06 22:41:29,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709512243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:29,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:29,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:41:29,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422818762] [2023-11-06 22:41:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:29,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:41:29,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:29,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:29,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:29,510 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 82 states have internal predecessors, (98), 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-06 22:41:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:29,630 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2023-11-06 22:41:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:29,633 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-06 22:41:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:29,648 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:41:29,648 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:41:29,650 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-06 22:41:29,658 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:29,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:41:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-06 22:41:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 76 states have internal predecessors, (83), 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-06 22:41:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-11-06 22:41:29,716 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 6 [2023-11-06 22:41:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:29,717 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-11-06 22:41:29,717 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-06 22:41:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-11-06 22:41:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:41:29,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:29,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:41:29,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:29,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 894752022, now seen corresponding path program 1 times [2023-11-06 22:41:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220667600] [2023-11-06 22:41:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:29,863 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-06 22:41:29,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220667600] [2023-11-06 22:41:29,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220667600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:29,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:29,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:41:29,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678591439] [2023-11-06 22:41:29,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:29,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:41:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:29,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:29,869 INFO L87 Difference]: Start difference. First operand 80 states and 87 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-06 22:41:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:29,925 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2023-11-06 22:41:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:29,926 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-06 22:41:29,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:29,928 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:41:29,928 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:41:29,928 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-06 22:41:29,930 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:29,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 141 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:41:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:41:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-06 22:41:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.588235294117647) internal successors, (81), 74 states have internal predecessors, (81), 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-06 22:41:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-11-06 22:41:29,942 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2023-11-06 22:41:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:29,942 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-11-06 22:41:29,943 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-06 22:41:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-11-06 22:41:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:41:29,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:29,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:41:29,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:29,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1374205737, now seen corresponding path program 1 times [2023-11-06 22:41:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057560100] [2023-11-06 22:41:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,089 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-06 22:41:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057560100] [2023-11-06 22:41:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057560100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:30,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:30,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:41:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751772926] [2023-11-06 22:41:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:30,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:41:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:41:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:41:30,094 INFO L87 Difference]: Start difference. First operand 78 states and 85 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-06 22:41:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:30,218 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-11-06 22:41:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:41:30,219 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-06 22:41:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:30,221 INFO L225 Difference]: With dead ends: 85 [2023-11-06 22:41:30,224 INFO L226 Difference]: Without dead ends: 85 [2023-11-06 22:41:30,224 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-06 22:41:30,226 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:30,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 206 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-06 22:41:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-11-06 22:41:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 75 states have internal predecessors, (82), 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-06 22:41:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2023-11-06 22:41:30,247 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 13 [2023-11-06 22:41:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:30,247 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2023-11-06 22:41:30,248 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-06 22:41:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2023-11-06 22:41:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:41:30,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:30,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:30,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:41:30,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:30,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash -469621220, now seen corresponding path program 1 times [2023-11-06 22:41:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059925766] [2023-11-06 22:41:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,609 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-06 22:41:30,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:30,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059925766] [2023-11-06 22:41:30,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059925766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:30,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:30,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:41:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941508468] [2023-11-06 22:41:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:30,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:41:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:41:30,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:41:30,616 INFO L87 Difference]: Start difference. First operand 79 states and 86 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-06 22:41:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:30,802 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2023-11-06 22:41:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:41:30,802 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-06 22:41:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:30,806 INFO L225 Difference]: With dead ends: 78 [2023-11-06 22:41:30,806 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 22:41:30,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-06 22:41:30,818 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:30,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 322 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 22:41:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-06 22:41:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 74 states have internal predecessors, (81), 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-06 22:41:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-11-06 22:41:30,834 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 22 [2023-11-06 22:41:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:30,835 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-11-06 22:41:30,835 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-06 22:41:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-11-06 22:41:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:41:30,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:30,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:30,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:41:30,837 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:30,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash -469621219, now seen corresponding path program 1 times [2023-11-06 22:41:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279273349] [2023-11-06 22:41:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:31,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:31,272 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-06 22:41:31,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:31,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279273349] [2023-11-06 22:41:31,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279273349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:31,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:31,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:41:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560479842] [2023-11-06 22:41:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:31,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:41:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:31,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:41:31,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:41:31,276 INFO L87 Difference]: Start difference. First operand 78 states and 85 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-06 22:41:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:31,446 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2023-11-06 22:41:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:41:31,447 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-06 22:41:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:31,450 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:41:31,451 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:41:31,451 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-06 22:41:31,455 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 3 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:31,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 344 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:41:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-06 22:41:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 73 states have internal predecessors, (80), 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-06 22:41:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2023-11-06 22:41:31,474 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 22 [2023-11-06 22:41:31,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:31,474 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2023-11-06 22:41:31,475 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-06 22:41:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2023-11-06 22:41:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:41:31,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:31,476 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-06 22:41:31,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:41:31,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:31,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:31,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1777293115, now seen corresponding path program 1 times [2023-11-06 22:41:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389963659] [2023-11-06 22:41:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:31,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:31,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:31,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:31,820 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-06 22:41:31,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:31,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389963659] [2023-11-06 22:41:31,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389963659] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:31,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725246421] [2023-11-06 22:41:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:31,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:31,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:31,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:31,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:41:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:31,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:41:31,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:32,060 INFO L351 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-06 22:41:32,193 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:41:32,194 INFO L351 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-06 22:41:32,271 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-06 22:41:32,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:32,671 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-06 22:41:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725246421] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:32,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:41:32,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-11-06 22:41:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776185431] [2023-11-06 22:41:32,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:32,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:41:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:32,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:41:32,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:41:32,674 INFO L87 Difference]: Start difference. First operand 77 states and 84 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-06 22:41:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:32,952 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2023-11-06 22:41:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:41:32,953 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-06 22:41:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:32,954 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:41:32,954 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:41:32,954 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-06 22:41:32,955 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 9 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:32,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 604 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:41:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-06 22:41:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 72 states have internal predecessors, (79), 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-06 22:41:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2023-11-06 22:41:32,961 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 25 [2023-11-06 22:41:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:32,961 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2023-11-06 22:41:32,962 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-06 22:41:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2023-11-06 22:41:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:41:32,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:32,963 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-06 22:41:32,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:33,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:33,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:33,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:33,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1777293114, now seen corresponding path program 1 times [2023-11-06 22:41:33,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:33,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167179970] [2023-11-06 22:41:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:33,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:33,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:33,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:33,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167179970] [2023-11-06 22:41:33,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167179970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:33,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913255256] [2023-11-06 22:41:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:33,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:33,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:33,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:33,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:41:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:33,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 22:41:33,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:33,924 INFO L351 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-06 22:41:33,928 INFO L351 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-06 22:41:34,167 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:41:34,168 INFO L351 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-06 22:41:34,175 INFO L351 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-06 22:41:34,225 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-06 22:41:34,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913255256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:34,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:41:34,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-11-06 22:41:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515375490] [2023-11-06 22:41:34,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:34,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:41:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:34,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:41:34,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:41:34,398 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:34,686 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-11-06 22:41:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:41:34,688 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-11-06 22:41:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:34,689 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:41:34,689 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:41:34,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:41:34,690 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 13 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:34,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 409 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:41:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-11-06 22:41:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5) internal successors, (78), 71 states have internal predecessors, (78), 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-06 22:41:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2023-11-06 22:41:34,695 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 25 [2023-11-06 22:41:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:34,696 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2023-11-06 22:41:34,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2023-11-06 22:41:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:41:34,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:34,703 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-06 22:41:34,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:34,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:41:34,910 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:34,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976759, now seen corresponding path program 1 times [2023-11-06 22:41:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314386013] [2023-11-06 22:41:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:35,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:35,187 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-06 22:41:35,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314386013] [2023-11-06 22:41:35,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314386013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:35,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:41:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168678987] [2023-11-06 22:41:35,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:35,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:41:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:41:35,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:41:35,201 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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-06 22:41:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:35,503 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-11-06 22:41:35,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:41:35,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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-06 22:41:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:35,506 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:41:35,506 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 22:41:35,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:41:35,508 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 139 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:35,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 393 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 22:41:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2023-11-06 22:41:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 74 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-06 22:41:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2023-11-06 22:41:35,513 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 30 [2023-11-06 22:41:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:35,514 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2023-11-06 22:41:35,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 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-06 22:41:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2023-11-06 22:41:35,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:41:35,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:35,515 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-06 22:41:35,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:41:35,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:35,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976758, now seen corresponding path program 1 times [2023-11-06 22:41:35,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:35,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479292167] [2023-11-06 22:41:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:35,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:35,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:35,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:35,917 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-06 22:41:35,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479292167] [2023-11-06 22:41:35,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479292167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:35,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:35,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:41:35,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781313313] [2023-11-06 22:41:35,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:35,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:41:35,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:35,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:41:35,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:41:35,920 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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-06 22:41:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:36,224 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-11-06 22:41:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:41:36,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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-06 22:41:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:36,226 INFO L225 Difference]: With dead ends: 81 [2023-11-06 22:41:36,226 INFO L226 Difference]: Without dead ends: 81 [2023-11-06 22:41:36,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:41:36,227 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 140 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:36,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 417 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:36,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-06 22:41:36,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-11-06 22:41:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.490909090909091) internal successors, (82), 74 states have internal predecessors, (82), 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-06 22:41:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-06 22:41:36,232 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 30 [2023-11-06 22:41:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:36,233 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-06 22:41:36,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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-06 22:41:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-06 22:41:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:41:36,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:36,235 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] [2023-11-06 22:41:36,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:41:36,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:36,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1458520006, now seen corresponding path program 1 times [2023-11-06 22:41:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:36,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696982607] [2023-11-06 22:41:36,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:36,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:36,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:36,345 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-06 22:41:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696982607] [2023-11-06 22:41:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696982607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:36,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:36,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:36,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905077574] [2023-11-06 22:41:36,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:36,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:36,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:36,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:36,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:36,348 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-06 22:41:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:36,433 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2023-11-06 22:41:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:36,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 32 [2023-11-06 22:41:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:36,435 INFO L225 Difference]: With dead ends: 132 [2023-11-06 22:41:36,435 INFO L226 Difference]: Without dead ends: 132 [2023-11-06 22:41:36,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:36,436 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:36,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 256 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-06 22:41:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2023-11-06 22:41:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 76 states have internal predecessors, (85), 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-06 22:41:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2023-11-06 22:41:36,445 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 32 [2023-11-06 22:41:36,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:36,447 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2023-11-06 22:41:36,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-06 22:41:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2023-11-06 22:41:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:41:36,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:36,455 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] [2023-11-06 22:41:36,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:41:36,455 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:36,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1458519951, now seen corresponding path program 1 times [2023-11-06 22:41:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272647844] [2023-11-06 22:41:36,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:36,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:36,689 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-06 22:41:36,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:36,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272647844] [2023-11-06 22:41:36,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272647844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:36,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:36,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:41:36,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298711922] [2023-11-06 22:41:36,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:36,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:41:36,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:36,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:41:36,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:41:36,692 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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-06 22:41:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:36,970 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2023-11-06 22:41:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:41:36,972 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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 32 [2023-11-06 22:41:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:36,973 INFO L225 Difference]: With dead ends: 106 [2023-11-06 22:41:36,973 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:41:36,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:41:36,974 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:36,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 392 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:41:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 83. [2023-11-06 22:41:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 79 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-06 22:41:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2023-11-06 22:41:36,978 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 32 [2023-11-06 22:41:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:36,978 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2023-11-06 22:41:36,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 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-06 22:41:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2023-11-06 22:41:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:41:36,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:36,979 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] [2023-11-06 22:41:36,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:41:36,979 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:36,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1458519952, now seen corresponding path program 1 times [2023-11-06 22:41:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:36,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708882121] [2023-11-06 22:41:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:37,143 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-06 22:41:37,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:37,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708882121] [2023-11-06 22:41:37,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708882121] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:37,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522514664] [2023-11-06 22:41:37,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:37,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:37,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:37,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:37,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:41:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:37,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:41:37,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:37,345 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-06 22:41:37,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:37,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522514664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:37,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:41:37,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-06 22:41:37,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611710808] [2023-11-06 22:41:37,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:37,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:41:37,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:37,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:41:37,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:41:37,347 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 22:41:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:37,370 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2023-11-06 22:41:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:41:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 32 [2023-11-06 22:41:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:37,373 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:41:37,373 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:41:37,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-06 22:41:37,374 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 106 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:37,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 145 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:41:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:41:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2023-11-06 22:41:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 80 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-06 22:41:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2023-11-06 22:41:37,378 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 32 [2023-11-06 22:41:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:37,378 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-11-06 22:41:37,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 22:41:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2023-11-06 22:41:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:41:37,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:37,381 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] [2023-11-06 22:41:37,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 22:41:37,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:41:37,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:37,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1990660867, now seen corresponding path program 1 times [2023-11-06 22:41:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:37,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025501589] [2023-11-06 22:41:37,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:37,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:37,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:41:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025501589] [2023-11-06 22:41:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025501589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:37,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:37,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752568714] [2023-11-06 22:41:37,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:37,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:37,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:37,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:37,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:37,709 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:41:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:37,792 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2023-11-06 22:41:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:37,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-06 22:41:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:37,794 INFO L225 Difference]: With dead ends: 98 [2023-11-06 22:41:37,794 INFO L226 Difference]: Without dead ends: 98 [2023-11-06 22:41:37,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:37,796 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 17 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:37,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 262 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-06 22:41:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2023-11-06 22:41:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 81 states have internal predecessors, (92), 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-06 22:41:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2023-11-06 22:41:37,801 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 33 [2023-11-06 22:41:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:37,801 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2023-11-06 22:41:37,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:41:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2023-11-06 22:41:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:41:37,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:37,803 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-06 22:41:37,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:41:37,804 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:37,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1726822356, now seen corresponding path program 1 times [2023-11-06 22:41:37,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:37,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522240686] [2023-11-06 22:41:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:37,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:38,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:41:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522240686] [2023-11-06 22:41:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522240686] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922900779] [2023-11-06 22:41:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:38,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:38,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:38,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:38,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:41:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:38,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:41:38,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:41:38,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:41:38,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922900779] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:38,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:41:38,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2023-11-06 22:41:38,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986121164] [2023-11-06 22:41:38,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:38,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:41:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:41:38,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:41:38,328 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:38,444 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2023-11-06 22:41:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:41:38,444 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-11-06 22:41:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:38,446 INFO L225 Difference]: With dead ends: 136 [2023-11-06 22:41:38,446 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:41:38,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:41:38,447 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 205 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:38,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 306 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:41:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 95. [2023-11-06 22:41:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 91 states have internal predecessors, (104), 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-06 22:41:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2023-11-06 22:41:38,452 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 37 [2023-11-06 22:41:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:38,452 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2023-11-06 22:41:38,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2023-11-06 22:41:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:41:38,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:38,453 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-11-06 22:41:38,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:38,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:41:38,659 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:38,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:38,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1952024607, now seen corresponding path program 1 times [2023-11-06 22:41:38,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:38,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972327210] [2023-11-06 22:41:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:39,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:39,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:39,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:39,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972327210] [2023-11-06 22:41:39,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972327210] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:39,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228024757] [2023-11-06 22:41:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:39,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:39,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:41:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:39,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-06 22:41:39,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:39,759 INFO L351 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-06 22:41:39,879 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:41:39,879 INFO L351 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-06 22:41:39,951 INFO L351 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-06 22:41:40,039 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:41:40,040 INFO L351 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-06 22:41:40,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:41:40,260 INFO L351 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 37 treesize of output 17 [2023-11-06 22:41:40,332 INFO L351 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 25 treesize of output 13 [2023-11-06 22:41:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:40,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:40,608 INFO L322 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-11-06 22:41:40,608 INFO L351 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 19 treesize of output 18 [2023-11-06 22:41:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228024757] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:40,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:41:40,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 32 [2023-11-06 22:41:40,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153571882] [2023-11-06 22:41:40,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:40,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 22:41:40,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:40,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 22:41:40,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2023-11-06 22:41:40,776 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:41:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:41,891 INFO L93 Difference]: Finished difference Result 185 states and 213 transitions. [2023-11-06 22:41:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:41:41,891 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2023-11-06 22:41:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:41,893 INFO L225 Difference]: With dead ends: 185 [2023-11-06 22:41:41,894 INFO L226 Difference]: Without dead ends: 185 [2023-11-06 22:41:41,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=199, Invalid=1963, Unknown=0, NotChecked=0, Total=2162 [2023-11-06 22:41:41,896 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 286 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:41,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1172 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:41:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-06 22:41:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 119. [2023-11-06 22:41:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.4) internal successors, (133), 114 states have internal predecessors, (133), 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-06 22:41:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2023-11-06 22:41:41,902 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 38 [2023-11-06 22:41:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:41,902 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2023-11-06 22:41:41,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:41:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2023-11-06 22:41:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:41:41,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:41,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-11-06 22:41:41,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:42,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:41:42,110 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:42,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1952024606, now seen corresponding path program 1 times [2023-11-06 22:41:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797928644] [2023-11-06 22:41:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:43,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:43,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797928644] [2023-11-06 22:41:43,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797928644] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:43,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14155395] [2023-11-06 22:41:43,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:43,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:43,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:43,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:43,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:41:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:43,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-06 22:41:43,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:43,659 INFO L351 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-06 22:41:44,069 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:41:44,070 INFO L351 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-06 22:41:44,080 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:41:44,195 INFO L351 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-06 22:41:44,199 INFO L351 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-06 22:41:44,341 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:41:44,341 INFO L351 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-06 22:41:44,347 INFO L351 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-06 22:41:44,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:41:44,630 INFO L351 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 43 treesize of output 23 [2023-11-06 22:41:44,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:41:44,637 INFO L351 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 42 treesize of output 22 [2023-11-06 22:41:44,740 INFO L351 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 31 treesize of output 19 [2023-11-06 22:41:44,746 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-06 22:41:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:44,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:45,124 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_1171 (Array Int Int))) (or (forall ((v_ArrVal_1172 Int)) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1172)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= (store .cse1 .cse0 (select v_ArrVal_1171 .cse0)) v_ArrVal_1171)))) (forall ((v_ArrVal_1171 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= (store .cse1 .cse0 (select v_ArrVal_1171 .cse0)) v_ArrVal_1171)))))) is different from false [2023-11-06 22:41:45,486 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1169) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1170 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-06 22:41:45,506 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1170 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1169) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2023-11-06 22:41:45,521 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:45,521 INFO L351 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 20 treesize of output 21 [2023-11-06 22:41:45,526 INFO L351 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 34 treesize of output 26 [2023-11-06 22:41:45,543 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:45,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2023-11-06 22:41:45,551 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:45,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-06 22:41:45,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:41:45,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-11-06 22:41:45,559 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:41:45,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-06 22:41:45,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14155395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:45,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:41:45,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2023-11-06 22:41:45,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137567177] [2023-11-06 22:41:45,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:45,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-06 22:41:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:45,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-06 22:41:45,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2311, Unknown=3, NotChecked=294, Total=2756 [2023-11-06 22:41:45,871 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand has 41 states, 40 states have (on average 1.65) internal successors, (66), 35 states have internal predecessors, (66), 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-06 22:41:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:47,792 INFO L93 Difference]: Finished difference Result 197 states and 228 transitions. [2023-11-06 22:41:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:41:47,793 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 35 states have internal predecessors, (66), 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 38 [2023-11-06 22:41:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:47,794 INFO L225 Difference]: With dead ends: 197 [2023-11-06 22:41:47,795 INFO L226 Difference]: Without dead ends: 197 [2023-11-06 22:41:47,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=260, Invalid=3171, Unknown=3, NotChecked=348, Total=3782 [2023-11-06 22:41:47,797 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 295 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:47,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1683 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:41:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-11-06 22:41:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2023-11-06 22:41:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 122 states have internal predecessors, (144), 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-06 22:41:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2023-11-06 22:41:47,804 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 38 [2023-11-06 22:41:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:47,804 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2023-11-06 22:41:47,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 35 states have internal predecessors, (66), 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-06 22:41:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2023-11-06 22:41:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:41:47,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:47,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2023-11-06 22:41:47,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:48,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:41:48,012 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:48,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1093777893, now seen corresponding path program 2 times [2023-11-06 22:41:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771753314] [2023-11-06 22:41:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:48,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:41:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:48,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771753314] [2023-11-06 22:41:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771753314] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403936856] [2023-11-06 22:41:48,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:41:48,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:48,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:48,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:41:48,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:41:48,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:48,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:41:48,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:41:48,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:41:48,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403936856] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:48,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:41:48,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2023-11-06 22:41:48,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285449740] [2023-11-06 22:41:48,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:48,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:41:48,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:41:48,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:41:48,601 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:48,706 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2023-11-06 22:41:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:41:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-11-06 22:41:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:48,708 INFO L225 Difference]: With dead ends: 123 [2023-11-06 22:41:48,708 INFO L226 Difference]: Without dead ends: 123 [2023-11-06 22:41:48,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:41:48,710 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 60 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:48,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 237 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-06 22:41:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-06 22:41:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 118 states have internal predecessors, (136), 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-06 22:41:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2023-11-06 22:41:48,716 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 41 [2023-11-06 22:41:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:48,717 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2023-11-06 22:41:48,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2023-11-06 22:41:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:41:48,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:48,718 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2023-11-06 22:41:48,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:48,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:41:48,918 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:48,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1377321232, now seen corresponding path program 2 times [2023-11-06 22:41:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:48,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286100812] [2023-11-06 22:41:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:49,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:41:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286100812] [2023-11-06 22:41:49,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286100812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:49,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212744745] [2023-11-06 22:41:49,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:41:49,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:49,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:49,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:49,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:41:49,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:41:49,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:49,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 22:41:49,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:41:49,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212744745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:49,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:41:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2023-11-06 22:41:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798417077] [2023-11-06 22:41:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:41:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:41:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:41:49,627 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-06 22:41:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:49,922 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2023-11-06 22:41:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:41:49,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 42 [2023-11-06 22:41:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:49,923 INFO L225 Difference]: With dead ends: 126 [2023-11-06 22:41:49,924 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:41:49,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:41:49,925 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 134 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:49,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 428 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:41:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:41:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2023-11-06 22:41:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.316831683168317) internal successors, (133), 118 states have internal predecessors, (133), 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-06 22:41:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2023-11-06 22:41:49,930 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 42 [2023-11-06 22:41:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:49,930 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2023-11-06 22:41:49,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-06 22:41:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2023-11-06 22:41:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:41:49,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:49,931 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:49,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:50,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:41:50,144 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:50,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1554940935, now seen corresponding path program 3 times [2023-11-06 22:41:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066077380] [2023-11-06 22:41:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:50,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:50,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:41:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:50,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066077380] [2023-11-06 22:41:50,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066077380] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:50,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839666652] [2023-11-06 22:41:50,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:41:50,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:50,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:50,392 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:50,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:41:50,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:41:50,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:50,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:41:50,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:41:50,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:41:51,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839666652] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:51,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:41:51,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2023-11-06 22:41:51,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041038726] [2023-11-06 22:41:51,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:51,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:41:51,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:51,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:41:51,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:41:51,054 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:51,232 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2023-11-06 22:41:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:41:51,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2023-11-06 22:41:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:51,234 INFO L225 Difference]: With dead ends: 122 [2023-11-06 22:41:51,234 INFO L226 Difference]: Without dead ends: 122 [2023-11-06 22:41:51,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:41:51,235 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 125 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:51,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 395 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-06 22:41:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2023-11-06 22:41:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 105 states have internal predecessors, (114), 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-06 22:41:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2023-11-06 22:41:51,240 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 46 [2023-11-06 22:41:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:51,240 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2023-11-06 22:41:51,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2023-11-06 22:41:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:41:51,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:51,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-06 22:41:51,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:51,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:51,449 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:51,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:51,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1515200418, now seen corresponding path program 1 times [2023-11-06 22:41:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:51,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612045853] [2023-11-06 22:41:51,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:51,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:51,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:41:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612045853] [2023-11-06 22:41:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612045853] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446483237] [2023-11-06 22:41:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:51,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:51,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:51,717 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:51,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:41:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:51,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:41:51,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:41:52,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:41:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446483237] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:52,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:41:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2023-11-06 22:41:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103621653] [2023-11-06 22:41:52,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:52,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:41:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:52,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:41:52,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:41:52,050 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:52,252 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2023-11-06 22:41:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:41:52,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2023-11-06 22:41:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:52,254 INFO L225 Difference]: With dead ends: 114 [2023-11-06 22:41:52,254 INFO L226 Difference]: Without dead ends: 114 [2023-11-06 22:41:52,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:41:52,255 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 236 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:52,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 434 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:41:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-06 22:41:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2023-11-06 22:41:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 105 states have internal predecessors, (112), 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-06 22:41:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2023-11-06 22:41:52,260 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 48 [2023-11-06 22:41:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:52,260 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2023-11-06 22:41:52,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:41:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2023-11-06 22:41:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 22:41:52,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:52,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:52,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:52,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:52,463 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:52,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1146011725, now seen corresponding path program 4 times [2023-11-06 22:41:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893930237] [2023-11-06 22:41:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:52,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:52,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:52,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:41:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:41:52,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:52,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893930237] [2023-11-06 22:41:52,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893930237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:52,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45199596] [2023-11-06 22:41:52,601 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:41:52,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:52,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:52,602 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:52,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:41:52,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:41:52,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:52,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:41:52,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:41:52,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:52,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45199596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:52,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:41:52,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-06 22:41:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643538017] [2023-11-06 22:41:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:52,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:41:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:41:52,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:52,899 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:41:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:52,911 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2023-11-06 22:41:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:41:52,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2023-11-06 22:41:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:41:52,912 INFO L225 Difference]: With dead ends: 89 [2023-11-06 22:41:52,912 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 22:41:52,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:41:52,913 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:41:52,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:41:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 22:41:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-06 22:41:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 85 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-06 22:41:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2023-11-06 22:41:52,917 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 50 [2023-11-06 22:41:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:41:52,918 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2023-11-06 22:41:52,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-06 22:41:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2023-11-06 22:41:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 22:41:52,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:41:52,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-06 22:41:52,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:53,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:41:53,125 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:41:53,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash 667135142, now seen corresponding path program 1 times [2023-11-06 22:41:53,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:53,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200194180] [2023-11-06 22:41:53,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:53,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:41:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:54,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:41:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:54,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200194180] [2023-11-06 22:41:54,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200194180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:54,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900635263] [2023-11-06 22:41:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:54,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:54,837 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:54,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:41:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:55,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-06 22:41:55,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:55,171 INFO L351 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-06 22:41:55,413 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:41:55,413 INFO L351 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-06 22:41:55,520 INFO L351 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-06 22:41:55,659 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:41:55,660 INFO L351 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 25 treesize of output 26 [2023-11-06 22:41:55,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:41:55,937 INFO L351 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 28 treesize of output 12 [2023-11-06 22:41:56,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-06 22:41:56,273 INFO L351 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 18 treesize of output 13 [2023-11-06 22:41:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:56,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:56,771 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2006) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2023-11-06 22:41:56,991 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2006) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2023-11-06 22:41:57,020 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:57,022 INFO L351 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 36 treesize of output 37 [2023-11-06 22:41:57,034 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:57,034 INFO L351 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 64 treesize of output 63 [2023-11-06 22:41:57,041 INFO L351 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 25 treesize of output 21 [2023-11-06 22:41:57,532 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:57,532 INFO L351 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 19 treesize of output 20 [2023-11-06 22:41:57,535 INFO L351 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 33 treesize of output 25 [2023-11-06 22:41:57,543 INFO L351 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-06 22:41:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-06 22:41:58,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900635263] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:58,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:41:58,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 27] total 72 [2023-11-06 22:41:58,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410805488] [2023-11-06 22:41:58,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:58,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-06 22:41:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-06 22:41:58,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=4542, Unknown=62, NotChecked=274, Total=5112 [2023-11-06 22:41:58,116 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 72 states, 71 states have (on average 1.704225352112676) internal successors, (121), 63 states have internal predecessors, (121), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:42:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:00,985 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2023-11-06 22:42:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:42:00,988 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.704225352112676) internal successors, (121), 63 states have internal predecessors, (121), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2023-11-06 22:42:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:00,989 INFO L225 Difference]: With dead ends: 89 [2023-11-06 22:42:00,989 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 22:42:00,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=596, Invalid=8092, Unknown=62, NotChecked=370, Total=9120 [2023-11-06 22:42:00,992 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 261 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:00,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1611 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1317 Invalid, 0 Unknown, 169 Unchecked, 1.1s Time] [2023-11-06 22:42:00,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 22:42:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-06 22:42:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2714285714285714) 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-06 22:42:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2023-11-06 22:42:00,996 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 51 [2023-11-06 22:42:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:00,996 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2023-11-06 22:42:00,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.704225352112676) internal successors, (121), 63 states have internal predecessors, (121), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-06 22:42:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2023-11-06 22:42:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 22:42:00,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:00,997 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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-06 22:42:01,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:42:01,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 22:42:01,204 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:01,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:01,205 INFO L85 PathProgramCache]: Analyzing trace with hash 132747908, now seen corresponding path program 1 times [2023-11-06 22:42:01,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:01,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377745838] [2023-11-06 22:42:01,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:01,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:01,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:42:01,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377745838] [2023-11-06 22:42:01,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377745838] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159341546] [2023-11-06 22:42:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:01,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:01,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:01,361 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:01,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:42:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:01,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:42:01,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:42:01,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:42:01,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159341546] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:01,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:42:01,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2023-11-06 22:42:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095432821] [2023-11-06 22:42:01,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:01,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:42:01,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:01,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:42:01,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:42:01,682 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:42:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:01,782 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2023-11-06 22:42:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:42:01,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-11-06 22:42:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:01,783 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:42:01,783 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:42:01,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:42:01,784 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 33 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:01,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 356 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:42:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:42:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-06 22:42:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 82 states have internal predecessors, (85), 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-06 22:42:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2023-11-06 22:42:01,790 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 55 [2023-11-06 22:42:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:01,791 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2023-11-06 22:42:01,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:42:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2023-11-06 22:42:01,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 22:42:01,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:01,792 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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-06 22:42:01,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:42:01,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-06 22:42:01,999 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:01,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash 132747853, now seen corresponding path program 1 times [2023-11-06 22:42:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:01,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268119809] [2023-11-06 22:42:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:03,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:42:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268119809] [2023-11-06 22:42:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268119809] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:03,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343241846] [2023-11-06 22:42:03,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:03,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:03,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:03,272 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:03,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:42:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:03,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-06 22:42:03,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:03,586 INFO L351 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-06 22:42:03,725 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:42:03,726 INFO L351 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-06 22:42:03,810 INFO L351 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-06 22:42:03,908 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:03,908 INFO L351 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 25 treesize of output 26 [2023-11-06 22:42:04,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:42:04,087 INFO L351 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 28 treesize of output 12 [2023-11-06 22:42:04,264 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:04,265 INFO L351 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-06 22:42:04,383 INFO L351 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 25 treesize of output 13 [2023-11-06 22:42:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:42:04,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:04,434 INFO L322 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-11-06 22:42:04,435 INFO L351 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 19 treesize of output 18 [2023-11-06 22:42:04,686 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2278 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2278) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2023-11-06 22:42:04,820 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_2276 Int) (v_ArrVal_2278 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| 4) v_ArrVal_2276))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2278) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-11-06 22:42:04,832 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_2276 Int) (v_ArrVal_2278 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| 4) v_ArrVal_2276))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) .cse0 v_ArrVal_2278) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2023-11-06 22:42:04,844 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_2276 Int) (v_ArrVal_2278 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| 4) v_ArrVal_2276))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2278) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2023-11-06 22:42:04,856 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_2276 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2275 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2275))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| 4) v_ArrVal_2276))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) .cse0 v_ArrVal_2278) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2023-11-06 22:42:04,881 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| Int) (v_ArrVal_2276 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2275 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2275))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_44| 4) v_ArrVal_2276))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_2278) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse2)))))) is different from false [2023-11-06 22:42:04,893 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:04,893 INFO L351 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 74 treesize of output 58 [2023-11-06 22:42:04,900 INFO L351 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 78 treesize of output 72 [2023-11-06 22:42:04,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:04,907 INFO L351 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 46 treesize of output 40 [2023-11-06 22:42:04,926 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:04,929 INFO L351 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 32 treesize of output 28 [2023-11-06 22:42:04,935 INFO L351 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 20 treesize of output 16 [2023-11-06 22:42:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 3 times theorem prover too weak. 1 trivial. 6 not checked. [2023-11-06 22:42:05,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343241846] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:05,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:42:05,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 56 [2023-11-06 22:42:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537880007] [2023-11-06 22:42:05,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:05,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-06 22:42:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-06 22:42:05,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2355, Unknown=59, NotChecked=618, Total=3192 [2023-11-06 22:42:05,444 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 57 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 49 states have internal predecessors, (117), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-06 22:42:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:07,625 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2023-11-06 22:42:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:42:07,626 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 49 states have internal predecessors, (117), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2023-11-06 22:42:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:07,627 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:42:07,627 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 22:42:07,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=320, Invalid=4067, Unknown=59, NotChecked=810, Total=5256 [2023-11-06 22:42:07,630 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 204 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 576 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:07,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1373 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1155 Invalid, 0 Unknown, 576 Unchecked, 1.0s Time] [2023-11-06 22:42:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 22:42:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2023-11-06 22:42:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 81 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-06 22:42:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2023-11-06 22:42:07,634 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 55 [2023-11-06 22:42:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:07,634 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2023-11-06 22:42:07,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 49 states have internal predecessors, (117), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-06 22:42:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2023-11-06 22:42:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 22:42:07,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:07,635 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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-06 22:42:07,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:42:07,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:07,843 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:07,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash 132747854, now seen corresponding path program 1 times [2023-11-06 22:42:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:07,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277381925] [2023-11-06 22:42:07,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:09,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:09,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:42:09,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277381925] [2023-11-06 22:42:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277381925] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:09,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473949621] [2023-11-06 22:42:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:09,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:09,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:09,789 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:09,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:42:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:10,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 103 conjunts are in the unsatisfiable core [2023-11-06 22:42:10,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:10,106 INFO L351 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-06 22:42:10,534 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:42:10,534 INFO L351 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 16 treesize of output 15 [2023-11-06 22:42:10,567 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:42:10,568 INFO L351 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-06 22:42:10,696 INFO L351 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-06 22:42:10,704 INFO L351 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-06 22:42:10,869 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:10,870 INFO L351 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-06 22:42:10,878 INFO L351 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-06 22:42:11,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:42:11,196 INFO L351 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 42 treesize of output 22 [2023-11-06 22:42:11,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:42:11,208 INFO L351 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 43 treesize of output 23 [2023-11-06 22:42:11,501 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:11,505 INFO L351 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-06 22:42:11,512 INFO L351 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-06 22:42:11,735 INFO L351 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 31 treesize of output 19 [2023-11-06 22:42:11,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-06 22:42:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:42:11,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:12,184 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2423 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2424) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2023-11-06 22:42:12,204 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2423 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2424) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2023-11-06 22:42:12,221 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2423 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2424) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2023-11-06 22:42:12,250 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_2423 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2424) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2023-11-06 22:42:12,325 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_2421 (Array Int Int))) (or (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_2422)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2421) .cse0 v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2424) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (not (= (store .cse4 .cse3 (select v_ArrVal_2421 .cse3)) v_ArrVal_2421)))) (forall ((v_ArrVal_2421 (Array Int Int))) (or (not (= (store .cse4 .cse3 (select v_ArrVal_2421 .cse3)) v_ArrVal_2421)) (forall ((v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2421) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_2422)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))))))) is different from false [2023-11-06 22:42:12,392 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (forall ((v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2421) (select (store .cse0 .cse1 v_ArrVal_2422) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= v_ArrVal_2421 (store .cse2 .cse1 (select v_ArrVal_2421 .cse1))))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (not (= v_ArrVal_2421 (store .cse2 .cse3 (select v_ArrVal_2421 .cse3)))) (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (let ((.cse5 (store .cse0 .cse3 v_ArrVal_2422))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2421) .cse4 v_ArrVal_2423) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse5) .cse4 v_ArrVal_2424) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))))))))) is different from false [2023-11-06 22:42:12,438 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int)) (or (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2421 .cse1)) v_ArrVal_2421)) (forall ((v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2421) (select (store .cse2 .cse1 v_ArrVal_2422) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2423) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (not (= (store .cse0 .cse3 (select v_ArrVal_2421 .cse3)) v_ArrVal_2421)) (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (let ((.cse5 (store .cse2 .cse3 v_ArrVal_2422))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2421) .cse4 v_ArrVal_2423) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse5) .cse4 v_ArrVal_2424) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))))))))) is different from false [2023-11-06 22:42:12,485 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int)) (or (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (not (= v_ArrVal_2421 (store .cse0 .cse1 (select v_ArrVal_2421 .cse1)))) (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (let ((.cse3 (store .cse4 .cse1 v_ArrVal_2422))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2421) .cse2 v_ArrVal_2423) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse3) .cse2 v_ArrVal_2424) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int)) (or (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (not (= v_ArrVal_2421 (store .cse0 .cse5 (select v_ArrVal_2421 .cse5)))) (forall ((v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2421) (select (store .cse4 .cse5 v_ArrVal_2422) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2423) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-06 22:42:12,558 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int) (v_ArrVal_2419 (Array Int Int))) (or (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2419)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (forall ((v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (<= 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2421) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2418) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_2422) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2423) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (not (= v_ArrVal_2421 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2421 .cse1))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int) (v_ArrVal_2419 (Array Int Int))) (or (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2419)) (.cse6 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2418))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse6 v_ArrVal_2422))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2421) .cse3 v_ArrVal_2423) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse5) .cse3 v_ArrVal_2424) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (not (= v_ArrVal_2421 (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse6 (select v_ArrVal_2421 .cse6))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-06 22:42:12,653 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int) (v_ArrVal_2419 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2419)) (.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (forall ((v_ArrVal_2424 (Array Int Int)) (v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2418))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_2422))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (<= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2421) .cse1 v_ArrVal_2423) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (select (store (store .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse3) .cse1 v_ArrVal_2424) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 (select v_ArrVal_2421 .cse4)) v_ArrVal_2421))))))) (forall ((v_ArrVal_2418 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| Int) (v_ArrVal_2419 (Array Int Int))) (or (forall ((v_ArrVal_2421 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2419)) (.cse6 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| 4))) (or (forall ((v_ArrVal_2423 (Array Int Int)) (v_ArrVal_2422 Int)) (<= 0 (+ (select (select (store (store .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2421) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2418) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse6 v_ArrVal_2422) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2423) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (not (= (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse6 (select v_ArrVal_2421 .cse6)) v_ArrVal_2421))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_49| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2023-11-06 22:42:12,695 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:12,695 INFO L351 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 38 treesize of output 39 [2023-11-06 22:42:12,703 INFO L351 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 70 treesize of output 66 [2023-11-06 22:42:12,715 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:12,715 INFO L351 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 112 treesize of output 112 [2023-11-06 22:42:12,722 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,726 INFO L351 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 32 treesize of output 28 [2023-11-06 22:42:12,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,736 INFO L351 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 40 treesize of output 34 [2023-11-06 22:42:12,754 INFO L351 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 124 treesize of output 118 [2023-11-06 22:42:12,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,774 INFO L351 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 36 treesize of output 32 [2023-11-06 22:42:12,780 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,782 INFO L351 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 28 treesize of output 26 [2023-11-06 22:42:12,787 INFO L351 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 54 treesize of output 50 [2023-11-06 22:42:12,804 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,816 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:12,816 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 120 [2023-11-06 22:42:12,828 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 93 [2023-11-06 22:42:12,837 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,844 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:12,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 152 [2023-11-06 22:42:12,856 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,860 INFO L351 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 42 treesize of output 34 [2023-11-06 22:42:12,865 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-06 22:42:12,875 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:12,878 INFO L351 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 16 treesize of output 12 [2023-11-06 22:42:13,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473949621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:13,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:42:13,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 46 [2023-11-06 22:42:13,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411962033] [2023-11-06 22:42:13,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:13,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-06 22:42:13,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:13,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-06 22:42:13,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2708, Unknown=10, NotChecked=1130, Total=4032 [2023-11-06 22:42:13,241 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 47 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 41 states have internal predecessors, (95), 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-06 22:42:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:14,895 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2023-11-06 22:42:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:42:14,895 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 41 states have internal predecessors, (95), 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 55 [2023-11-06 22:42:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:14,896 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:42:14,896 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:42:14,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=329, Invalid=4123, Unknown=10, NotChecked=1390, Total=5852 [2023-11-06 22:42:14,899 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 140 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:14,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1488 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:42:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:42:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2023-11-06 22:42:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 79 states have internal predecessors, (82), 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-06 22:42:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2023-11-06 22:42:14,903 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 55 [2023-11-06 22:42:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:14,904 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2023-11-06 22:42:14,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 41 states have internal predecessors, (95), 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-06 22:42:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2023-11-06 22:42:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:42:14,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:14,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-06 22:42:14,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-06 22:42:15,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 22:42:15,112 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:15,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1967923759, now seen corresponding path program 1 times [2023-11-06 22:42:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:15,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767339350] [2023-11-06 22:42:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:15,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:15,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:42:15,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767339350] [2023-11-06 22:42:15,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767339350] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:15,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352963640] [2023-11-06 22:42:15,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:15,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:15,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:15,245 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:15,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 22:42:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:15,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:42:15,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:42:15,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:42:15,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352963640] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:15,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:42:15,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-06 22:42:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759213934] [2023-11-06 22:42:15,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:15,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:42:15,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:15,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:42:15,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:42:15,619 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:42:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:15,717 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2023-11-06 22:42:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:42:15,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2023-11-06 22:42:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:15,719 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:42:15,719 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 22:42:15,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:42:15,720 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 59 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:15,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 273 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:42:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 22:42:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-06 22:42:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 79 states have internal predecessors, (81), 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-06 22:42:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2023-11-06 22:42:15,726 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 58 [2023-11-06 22:42:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:15,727 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2023-11-06 22:42:15,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:42:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2023-11-06 22:42:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:42:15,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:15,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-06 22:42:15,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:42:15,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-06 22:42:15,942 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:15,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1474497120, now seen corresponding path program 1 times [2023-11-06 22:42:15,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17461799] [2023-11-06 22:42:15,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:15,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:18,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:18,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:42:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17461799] [2023-11-06 22:42:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17461799] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:18,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708223334] [2023-11-06 22:42:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:18,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:18,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:18,513 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:18,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 22:42:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:18,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-06 22:42:18,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:18,850 INFO L351 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-06 22:42:19,163 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:42:19,164 INFO L351 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-06 22:42:19,276 INFO L351 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-06 22:42:19,410 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:19,410 INFO L351 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 25 treesize of output 26 [2023-11-06 22:42:19,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:42:19,694 INFO L351 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 28 treesize of output 12 [2023-11-06 22:42:20,071 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:20,071 INFO L351 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 66 treesize of output 59 [2023-11-06 22:42:20,077 INFO L351 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 25 treesize of output 17 [2023-11-06 22:42:20,082 INFO L351 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 34 treesize of output 21 [2023-11-06 22:42:20,515 INFO L351 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 33 treesize of output 21 [2023-11-06 22:42:20,525 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-06 22:42:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:20,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:21,239 INFO L351 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 76 treesize of output 56 [2023-11-06 22:42:21,250 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_2698 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_2700 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2700) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2023-11-06 22:42:21,283 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2700 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2700) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|)) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_2698 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2698) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|))) is different from false [2023-11-06 22:42:21,301 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:21,302 INFO L351 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 38 treesize of output 37 [2023-11-06 22:42:21,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-11-06 22:42:21,935 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2695 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2695) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) is different from false [2023-11-06 22:42:22,071 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:22,072 INFO L351 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 19 treesize of output 20 [2023-11-06 22:42:22,074 INFO L351 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 33 treesize of output 25 [2023-11-06 22:42:22,078 INFO L351 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-06 22:42:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-06 22:42:22,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708223334] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:22,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:42:22,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 30] total 85 [2023-11-06 22:42:22,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211840674] [2023-11-06 22:42:22,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:22,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2023-11-06 22:42:22,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2023-11-06 22:42:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=6368, Unknown=19, NotChecked=486, Total=7140 [2023-11-06 22:42:22,739 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 85 states, 83 states have (on average 1.8674698795180722) internal successors, (155), 76 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:42:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:27,256 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2023-11-06 22:42:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:42:27,257 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 83 states have (on average 1.8674698795180722) internal successors, (155), 76 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2023-11-06 22:42:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:27,259 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:42:27,259 INFO L226 Difference]: Without dead ends: 79 [2023-11-06 22:42:27,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=651, Invalid=10684, Unknown=19, NotChecked=636, Total=11990 [2023-11-06 22:42:27,265 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 359 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:27,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1954 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2092 Invalid, 0 Unknown, 228 Unchecked, 1.8s Time] [2023-11-06 22:42:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-06 22:42:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-06 22:42:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 75 states have internal predecessors, (77), 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-06 22:42:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2023-11-06 22:42:27,271 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 61 [2023-11-06 22:42:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:27,271 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2023-11-06 22:42:27,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 83 states have (on average 1.8674698795180722) internal successors, (155), 76 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:42:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2023-11-06 22:42:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:42:27,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:27,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:42:27,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:42:27,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-06 22:42:27,477 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:27,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash -334230315, now seen corresponding path program 1 times [2023-11-06 22:42:27,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:27,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485557443] [2023-11-06 22:42:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:42:27,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:27,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485557443] [2023-11-06 22:42:27,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485557443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:27,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:27,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:42:27,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138575856] [2023-11-06 22:42:27,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:27,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:42:27,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:27,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:42:27,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:42:27,730 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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-06 22:42:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:28,031 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2023-11-06 22:42:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:42:28,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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 63 [2023-11-06 22:42:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:28,033 INFO L225 Difference]: With dead ends: 97 [2023-11-06 22:42:28,033 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:42:28,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:42:28,034 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 91 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:28,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 282 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:42:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:42:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2023-11-06 22:42:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 states have internal predecessors, (83), 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-06 22:42:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-11-06 22:42:28,038 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 63 [2023-11-06 22:42:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:28,039 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-11-06 22:42:28,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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-06 22:42:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-11-06 22:42:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:42:28,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:28,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:42:28,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 22:42:28,040 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:28,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash -334230314, now seen corresponding path program 1 times [2023-11-06 22:42:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284827958] [2023-11-06 22:42:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:28,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:28,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:28,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:42:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284827958] [2023-11-06 22:42:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284827958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:42:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832355493] [2023-11-06 22:42:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:28,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:42:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:28,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:42:28,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:42:28,505 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 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-06 22:42:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:28,821 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2023-11-06 22:42:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:42:28,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 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 63 [2023-11-06 22:42:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:28,823 INFO L225 Difference]: With dead ends: 80 [2023-11-06 22:42:28,823 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:42:28,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:42:28,824 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 93 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:28,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 255 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:42:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:42:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-06 22:42:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 76 states have internal predecessors, (80), 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-06 22:42:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2023-11-06 22:42:28,828 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 63 [2023-11-06 22:42:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:28,828 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2023-11-06 22:42:28,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 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-06 22:42:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2023-11-06 22:42:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:42:28,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:28,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:42:28,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 22:42:28,830 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:28,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1771171289, now seen corresponding path program 1 times [2023-11-06 22:42:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:28,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803373204] [2023-11-06 22:42:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:42:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803373204] [2023-11-06 22:42:29,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803373204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:29,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:29,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:42:29,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466759269] [2023-11-06 22:42:29,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:29,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:42:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:42:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:42:29,135 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 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-06 22:42:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:29,331 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2023-11-06 22:42:29,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:42:29,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 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 64 [2023-11-06 22:42:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:29,333 INFO L225 Difference]: With dead ends: 80 [2023-11-06 22:42:29,333 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:42:29,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:42:29,334 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 91 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:29,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 327 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:42:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:42:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-06 22:42:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.144927536231884) internal successors, (79), 76 states have internal predecessors, (79), 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-06 22:42:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2023-11-06 22:42:29,339 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 64 [2023-11-06 22:42:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:29,340 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2023-11-06 22:42:29,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 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-06 22:42:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2023-11-06 22:42:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:42:29,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:29,341 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2023-11-06 22:42:29,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 22:42:29,342 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:29,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1321041315, now seen corresponding path program 1 times [2023-11-06 22:42:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:29,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128495644] [2023-11-06 22:42:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:29,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:29,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:29,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:42:29,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128495644] [2023-11-06 22:42:29,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128495644] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678695300] [2023-11-06 22:42:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:29,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:29,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:29,710 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:29,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 22:42:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:30,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 22:42:30,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:30,371 INFO L351 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 17 treesize of output 9 [2023-11-06 22:42:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:42:30,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:30,496 INFO L322 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-06 22:42:30,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 22:42:30,584 INFO L322 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-06 22:42:30,585 INFO L351 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 11 treesize of output 11 [2023-11-06 22:42:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:42:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678695300] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:30,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:42:30,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2023-11-06 22:42:30,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151953345] [2023-11-06 22:42:30,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:30,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 22:42:30,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:30,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 22:42:30,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:42:30,660 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 27 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:42:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:31,329 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2023-11-06 22:42:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:42:31,330 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2023-11-06 22:42:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:31,332 INFO L225 Difference]: With dead ends: 88 [2023-11-06 22:42:31,332 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 22:42:31,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2023-11-06 22:42:31,333 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 157 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:31,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 518 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:42:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 22:42:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2023-11-06 22:42:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 76 states have internal predecessors, (80), 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-06 22:42:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2023-11-06 22:42:31,338 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 66 [2023-11-06 22:42:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:31,338 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2023-11-06 22:42:31,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-06 22:42:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2023-11-06 22:42:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:42:31,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:31,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2023-11-06 22:42:31,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-06 22:42:31,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-06 22:42:31,547 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:31,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1321041314, now seen corresponding path program 1 times [2023-11-06 22:42:31,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:31,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640270677] [2023-11-06 22:42:31,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:33,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:33,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:42:33,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:33,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640270677] [2023-11-06 22:42:33,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640270677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:33,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56514228] [2023-11-06 22:42:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:33,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:33,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:33,579 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:33,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 22:42:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:34,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-06 22:42:34,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:34,033 INFO L351 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-06 22:42:34,331 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:42:34,332 INFO L351 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-06 22:42:34,460 INFO L351 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-06 22:42:34,467 INFO L351 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-06 22:42:34,647 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:34,647 INFO L351 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 41 treesize of output 38 [2023-11-06 22:42:34,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-06 22:42:34,991 INFO L322 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-06 22:42:34,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-11-06 22:42:35,014 INFO L322 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-06 22:42:35,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2023-11-06 22:42:35,302 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:35,303 INFO L351 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 30 treesize of output 30 [2023-11-06 22:42:35,570 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:42:35,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2023-11-06 22:42:36,427 INFO L351 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 23 treesize of output 15 [2023-11-06 22:42:36,432 INFO L351 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 14 [2023-11-06 22:42:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:42:36,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:37,058 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:37,058 INFO L351 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 31 treesize of output 35 [2023-11-06 22:42:37,322 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:37,323 INFO L351 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 28 treesize of output 32 [2023-11-06 22:42:38,544 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| Int) (v_ArrVal_3214 Int) (v_ArrVal_3213 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_20| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| 4))) (or (< |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_20|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| |v_ULTIMATE.start_main_~s~0#1.offset_20|) (not (= v_ArrVal_3213 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_3213 .cse0)))) (< |v_ULTIMATE.start_main_~s~0#1.offset_20| 0) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_3213) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 v_ArrVal_3214) |v_ULTIMATE.start_main_~s~0#1.offset_20|) v_ArrVal_3216) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_20|) 1))))) is different from false [2023-11-06 22:42:38,579 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| Int) (v_ArrVal_3214 Int) (v_ArrVal_3213 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_20| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| 4))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| |v_ULTIMATE.start_main_~s~0#1.offset_20|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3213) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_3214) |v_ULTIMATE.start_main_~s~0#1.offset_20|) v_ArrVal_3216) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_20|) 1)) (< |v_ULTIMATE.start_main_~s~0#1.offset_20| 0) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_20|) (not (= v_ArrVal_3213 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_3213 .cse0))))))) is different from false [2023-11-06 22:42:38,614 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| Int) (v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3214 Int) (v_ArrVal_3213 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_20| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3211)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| 4))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_3213 .cse1)) v_ArrVal_3213)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| |v_ULTIMATE.start_main_~s~0#1.offset_20|) (< |v_ULTIMATE.start_main_~s~0#1.offset_20| 0) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_20|) (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3213) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3212) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_3214) |v_ULTIMATE.start_main_~s~0#1.offset_20|) v_ArrVal_3216) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_20|) 1))))) is different from false [2023-11-06 22:42:38,676 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| Int) (v_ArrVal_3211 (Array Int Int)) (v_ArrVal_3212 (Array Int Int)) (v_ArrVal_3214 Int) (v_ArrVal_3213 (Array Int Int)) (v_ArrVal_3216 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_20| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3211)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| 4))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_59| |v_ULTIMATE.start_main_~s~0#1.offset_20|) (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3213) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3212) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_3214) |v_ULTIMATE.start_main_~s~0#1.offset_20|) v_ArrVal_3216) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_20|) 1)) (< |v_ULTIMATE.start_main_~s~0#1.offset_20| 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_20|) (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_3213 .cse1)) v_ArrVal_3213))))) is different from false [2023-11-06 22:42:38,705 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:38,705 INFO L351 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 38 treesize of output 39 [2023-11-06 22:42:38,715 INFO L351 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 70 treesize of output 66 [2023-11-06 22:42:38,731 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:38,731 INFO L351 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 104 treesize of output 104 [2023-11-06 22:42:38,748 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:38,761 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:38,761 INFO L351 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 36 treesize of output 38 [2023-11-06 22:42:38,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:38,776 INFO L351 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 28 treesize of output 24 [2023-11-06 22:42:38,787 INFO L351 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 46 treesize of output 42 [2023-11-06 22:42:38,809 INFO L351 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 50 treesize of output 46 [2023-11-06 22:42:38,828 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:38,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2023-11-06 22:42:38,861 INFO L322 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-06 22:42:38,861 INFO L351 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 47 [2023-11-06 22:42:38,893 INFO L351 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-06 22:42:38,995 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:38,995 INFO L351 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 31 treesize of output 35 [2023-11-06 22:42:39,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56514228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:39,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:42:39,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2023-11-06 22:42:39,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054847991] [2023-11-06 22:42:39,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:39,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-06 22:42:39,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:39,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-06 22:42:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4837, Unknown=33, NotChecked=572, Total=5700 [2023-11-06 22:42:39,426 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 55 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 49 states have internal predecessors, (117), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:42:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:42,454 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2023-11-06 22:42:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-06 22:42:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 49 states have internal predecessors, (117), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 66 [2023-11-06 22:42:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:42,456 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:42:42,456 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:42:42,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=544, Invalid=7995, Unknown=33, NotChecked=740, Total=9312 [2023-11-06 22:42:42,458 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 248 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:42,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1150 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:42:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:42:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2023-11-06 22:42:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.125) internal successors, (81), 78 states have internal predecessors, (81), 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-06 22:42:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2023-11-06 22:42:42,462 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 66 [2023-11-06 22:42:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:42,463 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2023-11-06 22:42:42,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 49 states have internal predecessors, (117), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 22:42:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2023-11-06 22:42:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:42:42,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:42,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2023-11-06 22:42:42,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:42:42,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-06 22:42:42,673 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:42,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:42,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1997390812, now seen corresponding path program 1 times [2023-11-06 22:42:42,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:42,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36508956] [2023-11-06 22:42:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:42:42,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36508956] [2023-11-06 22:42:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36508956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:42,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:42:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899281441] [2023-11-06 22:42:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:42,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:42:42,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:42,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:42:42,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:42:42,984 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 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-06 22:42:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:43,233 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2023-11-06 22:42:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:42:43,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 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 67 [2023-11-06 22:42:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:43,234 INFO L225 Difference]: With dead ends: 81 [2023-11-06 22:42:43,234 INFO L226 Difference]: Without dead ends: 81 [2023-11-06 22:42:43,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:42:43,235 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 80 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:43,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 284 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:42:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-06 22:42:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-06 22:42:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 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-06 22:42:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2023-11-06 22:42:43,240 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 67 [2023-11-06 22:42:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:43,241 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2023-11-06 22:42:43,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 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-06 22:42:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2023-11-06 22:42:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 22:42:43,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:43,243 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2023-11-06 22:42:43,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-06 22:42:43,243 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:43,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -356388511, now seen corresponding path program 1 times [2023-11-06 22:42:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:43,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795325657] [2023-11-06 22:42:43,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:44,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:44,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:42:44,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795325657] [2023-11-06 22:42:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795325657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:44,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829356722] [2023-11-06 22:42:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:44,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:44,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:44,894 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:44,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-06 22:42:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:45,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-06 22:42:45,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:45,354 INFO L351 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-06 22:42:45,444 INFO L351 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-06 22:42:45,540 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:42:45,542 INFO L351 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-06 22:42:45,661 INFO L351 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-06 22:42:45,808 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:45,808 INFO L351 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-06 22:42:45,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:42:45,946 INFO L351 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 37 treesize of output 17 [2023-11-06 22:42:46,209 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:46,210 INFO L351 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-06 22:42:46,469 INFO L351 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 25 treesize of output 13 [2023-11-06 22:42:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:42:46,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:46,791 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3435 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3435) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:42:46,800 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3435 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3435) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:42:46,808 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3435 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3435) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:42:46,829 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3435 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3435) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2023-11-06 22:42:46,993 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3433 Int) (v_ArrVal_3435 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|) (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_3433))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3435)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|))) is different from false [2023-11-06 22:42:47,006 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3433 Int) (v_ArrVal_3435 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_3433))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3435)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) |c_#StackHeapBarrier|))) is different from false [2023-11-06 22:42:47,019 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3433 Int) (v_ArrVal_3435 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_3433))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3435)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2023-11-06 22:42:47,034 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3432 (Array Int Int)) (v_ArrVal_3433 Int) (v_ArrVal_3435 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3432))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_3433))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3435))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|))) is different from false [2023-11-06 22:42:47,062 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3432 (Array Int Int)) (v_ArrVal_3433 Int) (v_ArrVal_3435 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3432))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_3433))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3435))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2023-11-06 22:42:47,077 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:47,077 INFO L351 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 78 treesize of output 62 [2023-11-06 22:42:47,083 INFO L351 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 119 treesize of output 111 [2023-11-06 22:42:47,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:47,091 INFO L351 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 90 treesize of output 84 [2023-11-06 22:42:47,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:47,099 INFO L351 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 75 treesize of output 67 [2023-11-06 22:42:47,109 INFO L351 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 24 treesize of output 22 [2023-11-06 22:42:47,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829356722] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:47,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:42:47,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 38 [2023-11-06 22:42:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924954309] [2023-11-06 22:42:47,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:47,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-06 22:42:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:47,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-06 22:42:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1744, Unknown=29, NotChecked=828, Total=2756 [2023-11-06 22:42:47,388 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 39 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 34 states have internal predecessors, (100), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:42:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:48,826 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2023-11-06 22:42:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:42:48,827 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 34 states have internal predecessors, (100), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 69 [2023-11-06 22:42:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:48,828 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:42:48,828 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 22:42:48,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=268, Invalid=2929, Unknown=31, NotChecked=1062, Total=4290 [2023-11-06 22:42:48,829 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 117 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:48,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 651 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:42:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 22:42:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2023-11-06 22:42:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.095890410958904) internal successors, (80), 78 states have internal predecessors, (80), 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-06 22:42:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2023-11-06 22:42:48,833 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 69 [2023-11-06 22:42:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:48,834 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2023-11-06 22:42:48,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 34 states have internal predecessors, (100), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:42:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2023-11-06 22:42:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-06 22:42:48,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:48,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-11-06 22:42:48,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:42:49,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-06 22:42:49,036 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:49,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1792929467, now seen corresponding path program 1 times [2023-11-06 22:42:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408528951] [2023-11-06 22:42:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:50,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:42:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408528951] [2023-11-06 22:42:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408528951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424873684] [2023-11-06 22:42:50,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:50,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:50,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:50,153 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:50,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-06 22:42:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:50,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-06 22:42:50,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:50,570 INFO L351 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-06 22:42:50,700 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:42:50,701 INFO L351 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-06 22:42:50,789 INFO L351 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-06 22:42:50,901 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:50,902 INFO L351 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 25 treesize of output 26 [2023-11-06 22:42:50,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:42:50,988 INFO L351 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 28 treesize of output 12 [2023-11-06 22:42:51,233 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 22:42:51,233 INFO L351 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 25 treesize of output 26 [2023-11-06 22:42:51,404 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:51,405 INFO L351 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 16 treesize of output 16 [2023-11-06 22:42:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:42:51,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:51,959 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3576 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3576) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2023-11-06 22:42:52,225 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| Int) (v_ArrVal_3576 (Array Int Int)) (v_ArrVal_3575 Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| 4) v_ArrVal_3575))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3576)) |c_ULTIMATE.start_main_~s~0#1.base|) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-11-06 22:42:52,237 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| Int) (v_ArrVal_3576 (Array Int Int)) (v_ArrVal_3575 Int)) (or (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| 4) v_ArrVal_3575))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3576)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2023-11-06 22:42:52,254 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| Int) (v_ArrVal_3576 (Array Int Int)) (v_ArrVal_3575 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| 4) v_ArrVal_3575))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3576)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))))) is different from false [2023-11-06 22:42:52,267 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3573 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| Int) (v_ArrVal_3576 (Array Int Int)) (v_ArrVal_3575 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3573))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| 4) v_ArrVal_3575))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3576))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))))) is different from false [2023-11-06 22:42:52,290 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3573 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| Int) (v_ArrVal_3576 (Array Int Int)) (v_ArrVal_3575 Int)) (or (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3573))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| 4) v_ArrVal_3575))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3576))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_69| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2023-11-06 22:42:52,304 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:52,304 INFO L351 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 80 treesize of output 65 [2023-11-06 22:42:52,308 INFO L351 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 117 treesize of output 109 [2023-11-06 22:42:52,315 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:52,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:52,325 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:52,325 INFO L351 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 94 treesize of output 94 [2023-11-06 22:42:52,331 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:52,332 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:52,354 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:52,355 INFO L351 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 66 treesize of output 69 [2023-11-06 22:42:52,362 INFO L351 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 58 [2023-11-06 22:42:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 9 refuted. 2 times theorem prover too weak. 11 trivial. 5 not checked. [2023-11-06 22:42:53,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424873684] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:53,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:42:53,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 61 [2023-11-06 22:42:53,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649541923] [2023-11-06 22:42:53,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:53,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-06 22:42:53,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-06 22:42:53,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2754, Unknown=56, NotChecked=666, Total=3660 [2023-11-06 22:42:53,418 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 61 states, 61 states have (on average 2.3934426229508197) internal successors, (146), 53 states have internal predecessors, (146), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:42:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:55,591 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2023-11-06 22:42:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:42:55,591 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.3934426229508197) internal successors, (146), 53 states have internal predecessors, (146), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2023-11-06 22:42:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:42:55,592 INFO L225 Difference]: With dead ends: 80 [2023-11-06 22:42:55,593 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:42:55,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=318, Invalid=4342, Unknown=56, NotChecked=834, Total=5550 [2023-11-06 22:42:55,594 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 177 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:42:55,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 949 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1127 Invalid, 0 Unknown, 430 Unchecked, 1.1s Time] [2023-11-06 22:42:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:42:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-11-06 22:42:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 75 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-06 22:42:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2023-11-06 22:42:55,599 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 70 [2023-11-06 22:42:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:42:55,600 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2023-11-06 22:42:55,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.3934426229508197) internal successors, (146), 53 states have internal predecessors, (146), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-06 22:42:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2023-11-06 22:42:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:42:55,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:42:55,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-11-06 22:42:55,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-06 22:42:55,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:55,809 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-06 22:42:55,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -10816926, now seen corresponding path program 1 times [2023-11-06 22:42:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752626749] [2023-11-06 22:42:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:42:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:42:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:42:58,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:58,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752626749] [2023-11-06 22:42:58,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752626749] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009659728] [2023-11-06 22:42:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:58,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:58,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:58,370 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:58,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1b9f12e-c1c3-4b09-b1c5-bcd23b4971e0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-06 22:42:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-06 22:42:58,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:58,801 INFO L351 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-06 22:42:59,120 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:42:59,120 INFO L351 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-06 22:42:59,269 INFO L351 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-06 22:42:59,281 INFO L351 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-06 22:42:59,497 INFO L322 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-11-06 22:42:59,498 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 34 [2023-11-06 22:42:59,505 INFO L351 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-06 22:42:59,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:42:59,940 INFO L322 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2023-11-06 22:42:59,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 29 [2023-11-06 22:42:59,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:42:59,949 INFO L351 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 42 treesize of output 22 [2023-11-06 22:43:00,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:00,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:43:00,439 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 22:43:00,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 52 [2023-11-06 22:43:00,447 INFO L351 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-06 22:43:00,882 INFO L351 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 30 treesize of output 18 [2023-11-06 22:43:01,367 INFO L322 Elim1Store]: treesize reduction 44, result has 58.1 percent of original size [2023-11-06 22:43:01,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 107 [2023-11-06 22:43:01,910 INFO L351 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-06 22:43:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:43:01,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:43:03,799 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|))) (and (or (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (or (forall ((v_ArrVal_3723 Int)) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) 0)) 1)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (forall ((v_ArrVal_3723 Int)) (not (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) 0)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (forall ((v_ArrVal_3723 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723)))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|))) (or (= (select .cse4 0) |c_ULTIMATE.start_main_~s~0#1.base|) (= (select |c_#valid| (select (select .cse5 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|)) 0)) 1))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (forall ((v_ArrVal_3723 Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723)))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~s~0#1.base|))) (or (= (select .cse6 0) |c_ULTIMATE.start_main_~s~0#1.base|) (not (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse7 (select (select .cse8 .cse7) 0)))))))))))) (forall ((v_ArrVal_3722 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3722) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0)))) is different from false [2023-11-06 22:43:15,328 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3720 (Array Int Int))) (let ((.cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3719 Int)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3719))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3723 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| (select v_ArrVal_3720 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select |c_#valid| (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) 0)) 1))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3720) .cse2 v_ArrVal_3722) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)))))) (not (= (store .cse6 .cse5 (select v_ArrVal_3720 .cse5)) v_ArrVal_3720))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3720 (Array Int Int))) (let ((.cse12 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3719 Int)) (let ((.cse11 (store .cse4 .cse12 v_ArrVal_3719))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3720) .cse7 v_ArrVal_3722) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (forall ((v_ArrVal_3723 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (or (not (let ((.cse8 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse11))) (store .cse10 .cse7 (store (select .cse10 .cse7) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723))))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select .cse8 .cse9) 0) .cse9)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| (select v_ArrVal_3720 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) (not (= (store .cse6 .cse12 (select v_ArrVal_3720 .cse12)) v_ArrVal_3720))))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3720 (Array Int Int))) (let ((.cse18 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3719 Int)) (let ((.cse17 (store .cse4 .cse18 v_ArrVal_3719))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3723 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse17))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723))))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select .cse13 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| (select v_ArrVal_3720 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select |c_#valid| (select (select .cse14 (select .cse13 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 0)) 1))))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3720) .cse16 v_ArrVal_3722) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)))))) (not (= (store .cse6 .cse18 (select v_ArrVal_3720 .cse18)) v_ArrVal_3720))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3720 (Array Int Int))) (let ((.cse25 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3719 Int)) (let ((.cse24 (store .cse4 .cse25 v_ArrVal_3719))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3723 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (let ((.cse20 (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse24))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723))))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select .cse19 0)) (not (let ((.cse21 (select .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select .cse20 .cse21) 0) .cse21))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| (select v_ArrVal_3720 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3720) .cse23 v_ArrVal_3722) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)))))) (not (= (store .cse6 .cse25 (select v_ArrVal_3720 .cse25)) v_ArrVal_3720))))))))) is different from false [2023-11-06 22:43:18,605 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse9 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_3717 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_3720 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3717)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_3720 .cse1)) v_ArrVal_3720)) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3719 Int)) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3719))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_3723 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (let ((.cse3 (let ((.cse5 (store .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse8))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (not (let ((.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) 0)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| (select v_ArrVal_3720 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select .cse4 0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3720) .cse6 v_ArrVal_3722) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0))))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (forall ((v_ArrVal_3717 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_3720 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3717)) (.cse15 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3719 Int)) (let ((.cse14 (store .cse9 .cse15 v_ArrVal_3719))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (not (= (select (select (store (store .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3720) .cse11 v_ArrVal_3722) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0)) (forall ((v_ArrVal_3723 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (or (= (select |c_#valid| (select (let ((.cse12 (let ((.cse13 (store .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse14))) (store .cse13 .cse11 (store (select .cse13 .cse11) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723))))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) 0)) 1) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| (select v_ArrVal_3720 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))) (not (= (store (select .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse15 (select v_ArrVal_3720 .cse15)) v_ArrVal_3720))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_3717 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_3720 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3717)) (.cse17 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (not (= (store (select .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse17 (select v_ArrVal_3720 .cse17)) v_ArrVal_3720)) (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3719 Int)) (let ((.cse22 (store .cse9 .cse17 v_ArrVal_3719))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_3723 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (or (not (let ((.cse19 (let ((.cse20 (store .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse22))) (store .cse20 .cse21 (store (select .cse20 .cse21) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723))))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= .cse18 (select (select .cse19 .cse18) 0))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| (select v_ArrVal_3720 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (not (= (select (select (store (store .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3720) .cse21 v_ArrVal_3722) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0))))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (forall ((v_ArrVal_3717 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_3720 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3717)) (.cse29 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (forall ((v_ArrVal_3722 (Array Int Int)) (v_ArrVal_3719 Int)) (let ((.cse27 (store .cse9 .cse29 v_ArrVal_3719))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_ArrVal_3723 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| Int)) (let ((.cse23 (let ((.cse25 (store .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse27))) (store .cse25 .cse26 (store (select .cse25 .cse26) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| 4) v_ArrVal_3723))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select |c_#valid| (select (select .cse23 (select .cse24 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 0)) 1) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_71| (select v_ArrVal_3720 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select .cse24 0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (not (= (select (select (store (store .cse28 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3720) .cse26 v_ArrVal_3722) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0)))))) (not (= (store (select .cse28 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse29 (select v_ArrVal_3720 .cse29)) v_ArrVal_3720))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) is different from false [2023-11-06 22:43:30,480 WARN L293 SmtUtils]: Spent 11.52s on a formula simplification. DAG size of input: 714 DAG size of output: 182 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:43:30,481 INFO L322 Elim1Store]: treesize reduction 1180, result has 20.4 percent of original size [2023-11-06 22:43:30,483 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 35 new quantified variables, introduced 154 case distinctions, treesize of input 252022 treesize of output 135510 [2023-11-06 22:43:36,763 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 525 DAG size of output: 174 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:43:36,764 INFO L322 Elim1Store]: treesize reduction 1185, result has 22.3 percent of original size [2023-11-06 22:43:36,764 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 23 new quantified variables, introduced 106 case distinctions, treesize of input 8062 treesize of output 5896 [2023-11-06 22:43:37,579 INFO L217 Elim1Store]: Index analysis took 472 ms [2023-11-06 22:43:41,704 INFO L322 Elim1Store]: treesize reduction 841, result has 44.2 percent of original size [2023-11-06 22:43:41,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 4849 treesize of output 5083 [2023-11-06 22:43:42,336 INFO L217 Elim1Store]: Index analysis took 143 ms [2023-11-06 22:43:53,378 WARN L293 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 422 DAG size of output: 358 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:43:53,378 INFO L322 Elim1Store]: treesize reduction 366, result has 77.3 percent of original size [2023-11-06 22:43:53,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 18 new quantified variables, introduced 91 case distinctions, treesize of input 5610 treesize of output 6162 [2023-11-06 22:43:54,199 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:43:54,199 INFO L351 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 3948 treesize of output 3925 [2023-11-06 22:43:54,868 INFO L351 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 4005 treesize of output 3995 [2023-11-06 22:43:55,339 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:43:55,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3988 treesize of output 3992 [2023-11-06 22:43:56,505 INFO L322 Elim1Store]: treesize reduction 64, result has 61.2 percent of original size [2023-11-06 22:43:56,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 3986 treesize of output 4180 [2023-11-06 22:43:57,487 INFO L351 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 3943 treesize of output 3941 [2023-11-06 22:43:58,170 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:43:58,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3941 treesize of output 3945 [2023-11-06 22:43:58,725 INFO L351 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 3932 treesize of output 3930 [2023-11-06 22:43:59,297 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:43:59,298 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3930 treesize of output 3934 [2023-11-06 22:43:59,974 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:43:59,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3921 treesize of output 3925 [2023-11-06 22:44:00,513 INFO L351 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 3912 treesize of output 3910 [2023-11-06 22:44:01,077 INFO L351 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 3910 treesize of output 3908